./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.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_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya --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 b9d8652519e41f29e8688122e81475e42760eeda179b59be7470de401a751998 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:17:18,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:17:18,954 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:17:18,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:17:18,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:17:18,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:17:18,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:17:18,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:17:18,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:17:18,986 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:17:18,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:17:18,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:17:18,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:17:18,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:17:18,989 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:17:18,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:17:18,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:17:18,990 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:17:18,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:17:18,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:17:18,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:17:18,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:17:18,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:17:18,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:17:18,997 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:17:18,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:17:18,998 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:17:18,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:17:18,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:17:18,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:17:18,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:17:19,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:17:19,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:17:19,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:17:19,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:17:19,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:17:19,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:17:19,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:17:19,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:17:19,002 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:17:19,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:17:19,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:17:19,003 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_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya 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 -> b9d8652519e41f29e8688122e81475e42760eeda179b59be7470de401a751998 [2023-11-29 05:17:19,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:17:19,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:17:19,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:17:19,254 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:17:19,254 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:17:19,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-11-29 05:17:22,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:17:22,237 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:17:22,238 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-11-29 05:17:22,250 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/data/6c32ee499/67a1fa645aab445eb1cfe962b6ef0392/FLAG497d24d04 [2023-11-29 05:17:22,261 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/data/6c32ee499/67a1fa645aab445eb1cfe962b6ef0392 [2023-11-29 05:17:22,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:17:22,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:17:22,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:17:22,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:17:22,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:17:22,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ceed19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22, skipping insertion in model container [2023-11-29 05:17:22,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,312 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:17:22,447 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_773967ab-59ab-48bb-8229-74711e832a90/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i[919,932] [2023-11-29 05:17:22,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:17:22,528 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:17:22,542 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_773967ab-59ab-48bb-8229-74711e832a90/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i[919,932] [2023-11-29 05:17:22,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:17:22,596 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:17:22,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22 WrapperNode [2023-11-29 05:17:22,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:17:22,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:17:22,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:17:22,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:17:22,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,648 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2023-11-29 05:17:22,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:17:22,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:17:22,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:17:22,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:17:22,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,680 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-29 05:17:22,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:17:22,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:17:22,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:17:22,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:17:22,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (1/1) ... [2023-11-29 05:17:22,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:17:22,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:22,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:17:22,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:17:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:17:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:17:22,765 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:17:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:17:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:17:22,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:17:22,856 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:17:22,859 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:17:23,177 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:17:23,210 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:17:23,211 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:17:23,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:17:23 BoogieIcfgContainer [2023-11-29 05:17:23,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:17:23,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:17:23,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:17:23,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:17:23,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:17:22" (1/3) ... [2023-11-29 05:17:23,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee0320e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:17:23, skipping insertion in model container [2023-11-29 05:17:23,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:22" (2/3) ... [2023-11-29 05:17:23,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee0320e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:17:23, skipping insertion in model container [2023-11-29 05:17:23,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:17:23" (3/3) ... [2023-11-29 05:17:23,220 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-11-29 05:17:23,234 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:17:23,234 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:17:23,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:17:23,282 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;@28daca31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:17:23,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:17:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 05:17:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-29 05:17:23,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:23,306 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:23,306 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:23,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:23,311 INFO L85 PathProgramCache]: Analyzing trace with hash 300904137, now seen corresponding path program 1 times [2023-11-29 05:17:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:23,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281141136] [2023-11-29 05:17:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:23,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:17:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:17:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:17:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:17:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:17:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:17:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:17:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:17:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:17:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:17:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:17:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:17:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:17:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:17:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:17:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:17:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:17:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 05:17:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:17:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:17:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:17:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:17:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:23,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281141136] [2023-11-29 05:17:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281141136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:23,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:23,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:17:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954918294] [2023-11-29 05:17:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:23,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:17:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:23,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:17:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:17:23,802 INFO L87 Difference]: Start difference. First operand has 88 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 05:17:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:23,847 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2023-11-29 05:17:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:17:23,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2023-11-29 05:17:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:23,859 INFO L225 Difference]: With dead ends: 173 [2023-11-29 05:17:23,859 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 05:17:23,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:17:23,868 INFO L413 NwaCegarLoop]: 135 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, 135 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-29 05:17:23,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 05:17:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-29 05:17:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.5) internal successors, (90), 60 states have internal predecessors, (90), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 05:17:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2023-11-29 05:17:23,914 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 161 [2023-11-29 05:17:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:23,915 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2023-11-29 05:17:23,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 05:17:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2023-11-29 05:17:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:17:23,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:23,921 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:23,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:17:23,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:23,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash -469619854, now seen corresponding path program 1 times [2023-11-29 05:17:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658946246] [2023-11-29 05:17:23,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:17:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:17:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:17:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:17:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:17:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:17:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:17:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:17:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:17:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:17:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:17:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:17:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:17:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:17:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:17:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:17:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:17:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 05:17:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:17:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:17:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:17:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:17:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658946246] [2023-11-29 05:17:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658946246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:24,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:24,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:17:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489596895] [2023-11-29 05:17:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:24,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:17:24,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:17:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:17:24,289 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:24,392 INFO L93 Difference]: Finished difference Result 256 states and 412 transitions. [2023-11-29 05:17:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:17:24,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2023-11-29 05:17:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:24,410 INFO L225 Difference]: With dead ends: 256 [2023-11-29 05:17:24,410 INFO L226 Difference]: Without dead ends: 171 [2023-11-29 05:17:24,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-29 05:17:24,413 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 85 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:24,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 269 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:17:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-29 05:17:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2023-11-29 05:17:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 05:17:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 272 transitions. [2023-11-29 05:17:24,452 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 272 transitions. Word has length 162 [2023-11-29 05:17:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:24,453 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 272 transitions. [2023-11-29 05:17:24,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 272 transitions. [2023-11-29 05:17:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:17:24,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:24,458 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:24,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:17:24,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:24,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:24,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2057967756, now seen corresponding path program 1 times [2023-11-29 05:17:24,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:24,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271970233] [2023-11-29 05:17:24,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:24,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:17:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:17:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:17:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:17:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:17:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:17:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:17:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:17:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:17:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:17:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:17:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:17:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:17:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:17:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:17:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:17:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:17:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 05:17:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:17:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:17:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:17:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:17:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:24,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271970233] [2023-11-29 05:17:24,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271970233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:24,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:24,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:17:24,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852774803] [2023-11-29 05:17:24,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:24,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:17:24,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:24,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:17:24,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:17:24,629 INFO L87 Difference]: Start difference. First operand 169 states and 272 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:24,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:24,724 INFO L93 Difference]: Finished difference Result 499 states and 802 transitions. [2023-11-29 05:17:24,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:17:24,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2023-11-29 05:17:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:24,730 INFO L225 Difference]: With dead ends: 499 [2023-11-29 05:17:24,731 INFO L226 Difference]: Without dead ends: 331 [2023-11-29 05:17:24,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:17:24,735 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 122 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:24,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 273 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-29 05:17:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2023-11-29 05:17:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 228 states have (on average 1.4385964912280702) internal successors, (328), 228 states have internal predecessors, (328), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 05:17:24,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 520 transitions. [2023-11-29 05:17:24,794 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 520 transitions. Word has length 162 [2023-11-29 05:17:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:24,796 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 520 transitions. [2023-11-29 05:17:24,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2023-11-29 05:17:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:17:24,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:24,800 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:24,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:17:24,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:24,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1471161742, now seen corresponding path program 1 times [2023-11-29 05:17:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390919096] [2023-11-29 05:17:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:17:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:17:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:24,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:17:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:17:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:17:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:17:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:17:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:17:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:17:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:17:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:17:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:17:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:17:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:17:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:17:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:17:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:17:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 05:17:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:17:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:17:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:17:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:17:25,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:25,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390919096] [2023-11-29 05:17:25,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390919096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:25,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:25,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:17:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779026957] [2023-11-29 05:17:25,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:25,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:17:25,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:25,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:17:25,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:17:25,072 INFO L87 Difference]: Start difference. First operand 329 states and 520 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:25,282 INFO L93 Difference]: Finished difference Result 744 states and 1178 transitions. [2023-11-29 05:17:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:17:25,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2023-11-29 05:17:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:25,289 INFO L225 Difference]: With dead ends: 744 [2023-11-29 05:17:25,289 INFO L226 Difference]: Without dead ends: 579 [2023-11-29 05:17:25,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-29 05:17:25,292 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 147 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:25,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 410 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:17:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2023-11-29 05:17:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 495. [2023-11-29 05:17:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 344 states have (on average 1.4244186046511629) internal successors, (490), 344 states have internal predecessors, (490), 144 states have call successors, (144), 6 states have call predecessors, (144), 6 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2023-11-29 05:17:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 778 transitions. [2023-11-29 05:17:25,357 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 778 transitions. Word has length 162 [2023-11-29 05:17:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:25,358 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 778 transitions. [2023-11-29 05:17:25,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 778 transitions. [2023-11-29 05:17:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 05:17:25,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:25,361 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:25,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:17:25,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:25,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash 686896349, now seen corresponding path program 1 times [2023-11-29 05:17:25,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:25,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423489668] [2023-11-29 05:17:25,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:25,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:17:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:17:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:17:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:17:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:17:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:17:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:17:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:17:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:17:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:17:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:17:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:17:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:17:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:17:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:17:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:17:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:17:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 05:17:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:17:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:17:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:17:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-11-29 05:17:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423489668] [2023-11-29 05:17:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423489668] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23519344] [2023-11-29 05:17:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:25,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:25,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:25,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:25,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:17:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:25,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:17:25,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 05:17:26,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:17:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-11-29 05:17:26,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23519344] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:17:26,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:17:26,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-29 05:17:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853171576] [2023-11-29 05:17:26,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:17:26,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:17:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:17:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:17:26,728 INFO L87 Difference]: Start difference. First operand 495 states and 778 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-11-29 05:17:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:27,137 INFO L93 Difference]: Finished difference Result 734 states and 1134 transitions. [2023-11-29 05:17:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:17:27,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 163 [2023-11-29 05:17:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:27,141 INFO L225 Difference]: With dead ends: 734 [2023-11-29 05:17:27,141 INFO L226 Difference]: Without dead ends: 406 [2023-11-29 05:17:27,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 369 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:17:27,143 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 174 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:27,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 411 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:17:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2023-11-29 05:17:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 351. [2023-11-29 05:17:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 246 states have (on average 1.3821138211382114) internal successors, (340), 246 states have internal predecessors, (340), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 05:17:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 532 transitions. [2023-11-29 05:17:27,206 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 532 transitions. Word has length 163 [2023-11-29 05:17:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:27,207 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 532 transitions. [2023-11-29 05:17:27,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-11-29 05:17:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 532 transitions. [2023-11-29 05:17:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 05:17:27,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:27,209 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:27,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:17:27,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:27,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:27,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1177427830, now seen corresponding path program 1 times [2023-11-29 05:17:27,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:27,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926176118] [2023-11-29 05:17:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:17:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:17:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:17:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:17:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:17:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:17:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:17:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:17:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:17:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:17:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:17:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:17:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:17:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:17:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:17:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:17:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:17:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 05:17:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:17:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:17:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:17:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:17:27,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:27,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926176118] [2023-11-29 05:17:27,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926176118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:27,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:27,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:17:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157265934] [2023-11-29 05:17:27,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:27,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:17:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:27,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:17:27,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:17:27,605 INFO L87 Difference]: Start difference. First operand 351 states and 532 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:27,718 INFO L93 Difference]: Finished difference Result 701 states and 1063 transitions. [2023-11-29 05:17:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:17:27,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2023-11-29 05:17:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:27,722 INFO L225 Difference]: With dead ends: 701 [2023-11-29 05:17:27,722 INFO L226 Difference]: Without dead ends: 351 [2023-11-29 05:17:27,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:17:27,724 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 20 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:27,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 214 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-11-29 05:17:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2023-11-29 05:17:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 246 states have (on average 1.3658536585365855) internal successors, (336), 246 states have internal predecessors, (336), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 05:17:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 528 transitions. [2023-11-29 05:17:27,802 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 528 transitions. Word has length 164 [2023-11-29 05:17:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:27,802 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 528 transitions. [2023-11-29 05:17:27,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 528 transitions. [2023-11-29 05:17:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 05:17:27,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:27,805 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:27,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:17:27,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:27,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash -956466764, now seen corresponding path program 1 times [2023-11-29 05:17:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:27,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774939080] [2023-11-29 05:17:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:27,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:17:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:17:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:17:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:17:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:17:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:17:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:17:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:17:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:27,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:17:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:17:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:17:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:17:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:17:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:17:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:17:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:17:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:17:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 05:17:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:17:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:17:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:17:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:17:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774939080] [2023-11-29 05:17:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774939080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:28,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:28,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:17:28,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634088014] [2023-11-29 05:17:28,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:28,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:17:28,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:28,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:17:28,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:17:28,052 INFO L87 Difference]: Start difference. First operand 351 states and 528 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:28,365 INFO L93 Difference]: Finished difference Result 623 states and 933 transitions. [2023-11-29 05:17:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:17:28,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2023-11-29 05:17:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:28,369 INFO L225 Difference]: With dead ends: 623 [2023-11-29 05:17:28,369 INFO L226 Difference]: Without dead ends: 273 [2023-11-29 05:17:28,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:17:28,371 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 154 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:28,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 455 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:17:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-29 05:17:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 242. [2023-11-29 05:17:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 163 states have internal predecessors, (215), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-29 05:17:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2023-11-29 05:17:28,433 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 165 [2023-11-29 05:17:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:28,434 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2023-11-29 05:17:28,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:17:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2023-11-29 05:17:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 05:17:28,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:28,437 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:28,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:17:28,437 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:28,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash 323396914, now seen corresponding path program 1 times [2023-11-29 05:17:28,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557724280] [2023-11-29 05:17:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:17:28,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:17:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:17:28,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:17:28,652 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:17:28,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:17:28,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:17:28,658 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:28,661 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:17:28,776 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 05:17:28,777 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short21 could not be translated [2023-11-29 05:17:28,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:17:28 BoogieIcfgContainer [2023-11-29 05:17:28,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:17:28,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:17:28,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:17:28,802 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:17:28,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:17:23" (3/4) ... [2023-11-29 05:17:28,804 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:17:28,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:17:28,805 INFO L158 Benchmark]: Toolchain (without parser) took 6540.64ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 116.0MB in the beginning and 119.8MB in the end (delta: -3.8MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2023-11-29 05:17:28,806 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:17:28,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.07ms. Allocated memory is still 155.2MB. Free memory was 116.0MB in the beginning and 101.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:17:28,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.60ms. Allocated memory is still 155.2MB. Free memory was 101.4MB in the beginning and 98.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:17:28,806 INFO L158 Benchmark]: Boogie Preprocessor took 50.69ms. Allocated memory is still 155.2MB. Free memory was 98.8MB in the beginning and 95.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:17:28,807 INFO L158 Benchmark]: RCFGBuilder took 510.48ms. Allocated memory is still 155.2MB. Free memory was 95.6MB in the beginning and 73.1MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:17:28,807 INFO L158 Benchmark]: TraceAbstraction took 5587.67ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 72.6MB in the beginning and 120.9MB in the end (delta: -48.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2023-11-29 05:17:28,807 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 232.8MB. Free memory was 120.9MB in the beginning and 119.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:17:28,809 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.22ms. Allocated memory is still 155.2MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.07ms. Allocated memory is still 155.2MB. Free memory was 116.0MB in the beginning and 101.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.60ms. Allocated memory is still 155.2MB. Free memory was 101.4MB in the beginning and 98.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.69ms. Allocated memory is still 155.2MB. Free memory was 98.8MB in the beginning and 95.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 510.48ms. Allocated memory is still 155.2MB. Free memory was 95.6MB in the beginning and 73.1MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5587.67ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 72.6MB in the beginning and 120.9MB in the end (delta: -48.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 232.8MB. Free memory was 120.9MB in the beginning and 119.8MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short21 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_21 = 100.4; [L37] signed long int var_1_24 = 10; [L38] signed char var_1_25 = -8; [L39] double var_1_26 = 9.75; [L40] signed char var_1_28 = 8; [L41] unsigned long int var_1_29 = 16; [L42] unsigned long int var_1_30 = 1; [L43] float var_1_31 = 16.6; [L44] signed short int var_1_35 = 256; [L45] unsigned long int var_1_36 = 16; [L46] double var_1_37 = 8.5; [L47] unsigned long int var_1_38 = 3569725445; [L48] unsigned long int var_1_39 = 3551809449; [L49] unsigned long int var_1_40 = 10000000; [L50] unsigned char last_1_var_1_1 = 1; [L51] signed long int last_1_var_1_11 = -2; [L52] signed long int last_1_var_1_15 = 1000; [L53] double last_1_var_1_16 = 0.2; [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L192] last_1_var_1_1 = var_1_1 [L193] last_1_var_1_11 = var_1_11 [L194] last_1_var_1_15 = var_1_15 [L195] last_1_var_1_16 = var_1_16 [L205] RET updateLastVariables() [L206] CALL updateVariables() [L151] var_1_4 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L152] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L153] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L153] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L154] var_1_7 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L155] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L156] var_1_10 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L157] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L158] var_1_13 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L159] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L160] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L160] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L161] var_1_14 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L163] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L163] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L165] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L166] var_1_18 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L167] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L168] var_1_21 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L170] var_1_26 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L171] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L172] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L172] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L173] var_1_28 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L175] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L175] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L176] var_1_30 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L178] CALL assume_abort_if_not(var_1_30 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L178] RET assume_abort_if_not(var_1_30 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L179] var_1_37 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L181] var_1_38 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L182] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L183] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L183] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L184] var_1_39 = __VERIFIER_nondet_ulong() [L185] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L185] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L186] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L186] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L187] var_1_40 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L189] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L189] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L206] RET updateVariables() [L207] CALL step() [L57] COND TRUE (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - var_1_21) == (var_1_16 * var_1_7) [L58] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L60] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L61] COND TRUE var_1_21 != var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L62] COND TRUE var_1_5 < (var_1_10 / var_1_26) [L63] var_1_25 = ((((4) < 0 ) ? -(4) : (4))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L74] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L75] COND FALSE !(var_1_7 > var_1_17) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L82] COND TRUE \read(var_1_1) [L83] var_1_31 = ((((((((var_1_7) < (var_1_18)) ? (var_1_7) : (var_1_18))) < 0 ) ? -((((var_1_7) < (var_1_18)) ? (var_1_7) : (var_1_18))) : ((((var_1_7) < (var_1_18)) ? (var_1_7) : (var_1_18))))) - 256.35f) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L86] COND TRUE ! ((1 + var_1_11) <= var_1_11) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L87] COND FALSE !(var_1_11 > (((((((-5) < 0 ) ? -(-5) : (-5))) < 0 ) ? -((((-5) < 0 ) ? -(-5) : (-5))) : ((((-5) < 0 ) ? -(-5) : (-5)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L91] COND FALSE !(var_1_21 < var_1_7) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L98] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L99] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L100] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L105] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L106] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L107] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L109] signed long int stepLocal_2 = var_1_11; [L110] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L111] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L112] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L113] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L114] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L120] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L120] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L131] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L133] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L134] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L138] COND FALSE !(10.55f < var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L143] COND TRUE var_1_16 > var_1_7 [L144] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_10=100000000000004, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L207] RET step() [L208] CALL, EXPR property() [L198] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L198-L199] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=4, var_1_14=0, var_1_15=4, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=-127, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 703 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 2167 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1171 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 512 IncrementalHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 996 mSDtfsCounter, 512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 722 GetRequests, 693 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 174 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1456 ConstructedInterpolants, 0 QuantifiedInterpolants, 4136 SizeOfPredicates, 4 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 9729/9936 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-29 05:17:28,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya --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 b9d8652519e41f29e8688122e81475e42760eeda179b59be7470de401a751998 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:17:30,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:17:30,892 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:17:30,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:17:30,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:17:30,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:17:30,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:17:30,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:17:30,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:17:30,933 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:17:30,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:17:30,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:17:30,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:17:30,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:17:30,936 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:17:30,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:17:30,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:17:30,938 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:17:30,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:17:30,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:17:30,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:17:30,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:17:30,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:17:30,944 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:17:30,945 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:17:30,945 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:17:30,946 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:17:30,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:17:30,946 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:17:30,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:17:30,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:17:30,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:17:30,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:17:30,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:17:30,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:17:30,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:17:30,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:17:30,949 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:17:30,949 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:17:30,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:17:30,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:17:30,950 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:17:30,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:17:30,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:17:30,951 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:17:30,951 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_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya 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 -> b9d8652519e41f29e8688122e81475e42760eeda179b59be7470de401a751998 [2023-11-29 05:17:31,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:17:31,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:17:31,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:17:31,291 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:17:31,291 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:17:31,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-11-29 05:17:34,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:17:34,263 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:17:34,263 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-11-29 05:17:34,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/data/03c3b4b82/7d917ed1dd0d4aaa93c8753341e73343/FLAG7e3e0a693 [2023-11-29 05:17:34,289 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/data/03c3b4b82/7d917ed1dd0d4aaa93c8753341e73343 [2023-11-29 05:17:34,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:17:34,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:17:34,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:17:34,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:17:34,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:17:34,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b2d26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34, skipping insertion in model container [2023-11-29 05:17:34,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,348 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:17:34,511 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_773967ab-59ab-48bb-8229-74711e832a90/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i[919,932] [2023-11-29 05:17:34,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:17:34,595 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:17:34,609 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_773967ab-59ab-48bb-8229-74711e832a90/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i[919,932] [2023-11-29 05:17:34,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:17:34,662 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:17:34,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34 WrapperNode [2023-11-29 05:17:34,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:17:34,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:17:34,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:17:34,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:17:34,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,721 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2023-11-29 05:17:34,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:17:34,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:17:34,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:17:34,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:17:34,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,757 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-29 05:17:34,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:17:34,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:17:34,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:17:34,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:17:34,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (1/1) ... [2023-11-29 05:17:34,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:17:34,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:34,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:17:34,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:17:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:17:34,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:17:34,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:17:34,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:17:34,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:17:34,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:17:34,961 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:17:34,963 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:17:54,897 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:17:54,952 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:17:54,952 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:17:54,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:17:54 BoogieIcfgContainer [2023-11-29 05:17:54,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:17:54,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:17:54,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:17:54,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:17:54,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:17:34" (1/3) ... [2023-11-29 05:17:54,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a82cd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:17:54, skipping insertion in model container [2023-11-29 05:17:54,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:17:34" (2/3) ... [2023-11-29 05:17:54,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a82cd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:17:54, skipping insertion in model container [2023-11-29 05:17:54,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:17:54" (3/3) ... [2023-11-29 05:17:54,961 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-11-29 05:17:54,977 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:17:54,977 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:17:55,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:17:55,029 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;@5eb9fc28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:17:55,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:17:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 55 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 05:17:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:17:55,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:55,053 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:55,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:55,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 842033716, now seen corresponding path program 1 times [2023-11-29 05:17:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:17:55,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639751792] [2023-11-29 05:17:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:55,073 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-29 05:17:55,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:17:55,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:17:55,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:17:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:56,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:17:56,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2023-11-29 05:17:56,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:17:56,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:17:56,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639751792] [2023-11-29 05:17:56,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639751792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:56,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:56,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:17:56,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280817774] [2023-11-29 05:17:56,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:56,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:17:56,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:17:56,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:17:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:17:56,991 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 55 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 05:18:01,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:01,217 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2023-11-29 05:18:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:18:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 158 [2023-11-29 05:18:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:01,282 INFO L225 Difference]: With dead ends: 159 [2023-11-29 05:18:01,282 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 05:18:01,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-29 05:18:01,289 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:01,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 05:18:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 05:18:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-29 05:18:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 05:18:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 127 transitions. [2023-11-29 05:18:01,337 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 127 transitions. Word has length 158 [2023-11-29 05:18:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:01,338 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 127 transitions. [2023-11-29 05:18:01,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 05:18:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 127 transitions. [2023-11-29 05:18:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:18:01,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:01,343 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:01,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:18:01,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:18:01,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:01,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1755523004, now seen corresponding path program 1 times [2023-11-29 05:18:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:18:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860746396] [2023-11-29 05:18:01,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:01,547 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-29 05:18:01,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:18:01,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:18:01,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:18:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:03,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:18:03,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:18:04,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:18:04,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:18:04,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860746396] [2023-11-29 05:18:04,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860746396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:04,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:04,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:18:04,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662190271] [2023-11-29 05:18:04,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:04,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:18:04,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:18:04,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:18:04,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:04,938 INFO L87 Difference]: Start difference. First operand 79 states and 127 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:18:08,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:12,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:16,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:20,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:21,003 INFO L93 Difference]: Finished difference Result 235 states and 379 transitions. [2023-11-29 05:18:21,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:18:21,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2023-11-29 05:18:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:21,007 INFO L225 Difference]: With dead ends: 235 [2023-11-29 05:18:21,008 INFO L226 Difference]: Without dead ends: 157 [2023-11-29 05:18:21,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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-29 05:18:21,010 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 47 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:21,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 248 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 16.0s Time] [2023-11-29 05:18:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-29 05:18:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2023-11-29 05:18:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.4711538461538463) internal successors, (153), 104 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 05:18:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 249 transitions. [2023-11-29 05:18:21,054 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 249 transitions. Word has length 158 [2023-11-29 05:18:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:21,056 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 249 transitions. [2023-11-29 05:18:21,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:18:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 249 transitions. [2023-11-29 05:18:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-29 05:18:21,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:21,061 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:21,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:18:21,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:18:21,264 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:21,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1915940903, now seen corresponding path program 1 times [2023-11-29 05:18:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:18:21,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740017630] [2023-11-29 05:18:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:21,265 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-29 05:18:21,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:18:21,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:18:21,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:18:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:22,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:18:22,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:18:24,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:18:24,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:18:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740017630] [2023-11-29 05:18:24,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740017630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:24,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:24,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:18:24,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524211487] [2023-11-29 05:18:24,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:24,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:24,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:18:24,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:24,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:18:24,229 INFO L87 Difference]: Start difference. First operand 155 states and 249 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:18:25,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:30,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:34,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:38,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:39,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:43,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:47,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:51,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:51,928 INFO L93 Difference]: Finished difference Result 495 states and 797 transitions. [2023-11-29 05:18:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2023-11-29 05:18:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:51,995 INFO L225 Difference]: With dead ends: 495 [2023-11-29 05:18:51,995 INFO L226 Difference]: Without dead ends: 341 [2023-11-29 05:18:51,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:51,998 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 122 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 54 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:51,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 370 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 25 Invalid, 6 Unknown, 0 Unchecked, 27.6s Time] [2023-11-29 05:18:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-29 05:18:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 307. [2023-11-29 05:18:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 206 states have (on average 1.4174757281553398) internal successors, (292), 206 states have internal predecessors, (292), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 05:18:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 484 transitions. [2023-11-29 05:18:52,058 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 484 transitions. Word has length 159 [2023-11-29 05:18:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:52,059 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 484 transitions. [2023-11-29 05:18:52,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:18:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 484 transitions. [2023-11-29 05:18:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-29 05:18:52,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:52,063 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:52,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-29 05:18:52,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:18:52,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:52,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1011135840, now seen corresponding path program 1 times [2023-11-29 05:18:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:18:52,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719943923] [2023-11-29 05:18:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:52,269 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-29 05:18:52,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:18:52,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:18:52,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:18:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:53,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:18:53,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 132 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 05:18:56,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-11-29 05:18:57,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:18:57,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719943923] [2023-11-29 05:18:57,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719943923] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:57,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:18:57,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-29 05:18:57,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819738763] [2023-11-29 05:18:57,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:57,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:18:57,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:18:57,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:18:57,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:18:57,654 INFO L87 Difference]: Start difference. First operand 307 states and 484 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 3 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) [2023-11-29 05:19:01,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:19:05,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:19:09,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:19:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:09,330 INFO L93 Difference]: Finished difference Result 502 states and 765 transitions. [2023-11-29 05:19:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:19:09,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 3 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) Word has length 160 [2023-11-29 05:19:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:09,336 INFO L225 Difference]: With dead ends: 502 [2023-11-29 05:19:09,336 INFO L226 Difference]: Without dead ends: 348 [2023-11-29 05:19:09,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:19:09,338 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 271 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 102 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:09,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 339 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 277 Invalid, 1 Unknown, 0 Unchecked, 11.1s Time] [2023-11-29 05:19:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-29 05:19:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 339. [2023-11-29 05:19:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 230 states have internal predecessors, (306), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 05:19:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 498 transitions. [2023-11-29 05:19:09,381 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 498 transitions. Word has length 160 [2023-11-29 05:19:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:09,382 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 498 transitions. [2023-11-29 05:19:09,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 3 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (48), 2 states have call predecessors, (48), 3 states have call successors, (48) [2023-11-29 05:19:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 498 transitions. [2023-11-29 05:19:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-29 05:19:09,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:09,385 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:09,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:19:09,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:19:09,586 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:19:09,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1578668163, now seen corresponding path program 1 times [2023-11-29 05:19:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:19:09,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719796476] [2023-11-29 05:19:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:09,587 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-29 05:19:09,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:19:09,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:19:09,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:19:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:11,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:19:11,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:19:12,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:19:12,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:19:12,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719796476] [2023-11-29 05:19:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719796476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:19:12,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:19:12,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:19:12,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229413484] [2023-11-29 05:19:12,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:19:12,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:19:12,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:19:12,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:19:12,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:19:12,494 INFO L87 Difference]: Start difference. First operand 339 states and 498 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:19:18,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:19:21,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:19:26,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:19:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:26,527 INFO L93 Difference]: Finished difference Result 602 states and 880 transitions. [2023-11-29 05:19:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:19:26,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2023-11-29 05:19:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:26,530 INFO L225 Difference]: With dead ends: 602 [2023-11-29 05:19:26,530 INFO L226 Difference]: Without dead ends: 264 [2023-11-29 05:19:26,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:19:26,533 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 125 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:26,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 393 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 99 Invalid, 2 Unknown, 0 Unchecked, 13.9s Time] [2023-11-29 05:19:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-29 05:19:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 240. [2023-11-29 05:19:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 158 states have internal predecessors, (203), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-29 05:19:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 347 transitions. [2023-11-29 05:19:26,567 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 347 transitions. Word has length 161 [2023-11-29 05:19:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:26,568 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 347 transitions. [2023-11-29 05:19:26,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:19:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 347 transitions. [2023-11-29 05:19:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-29 05:19:26,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:26,571 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:26,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 05:19:26,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:19:26,771 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:19:26,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash 877603585, now seen corresponding path program 1 times [2023-11-29 05:19:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:19:26,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172591083] [2023-11-29 05:19:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:26,773 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-29 05:19:26,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:19:26,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:19:26,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 05:19:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:28,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:19:28,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 05:19:28,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:19:28,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:19:28,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172591083] [2023-11-29 05:19:28,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172591083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:19:28,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:19:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:19:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962879949] [2023-11-29 05:19:28,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:19:28,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:19:28,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:19:28,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:19:28,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:19:28,529 INFO L87 Difference]: Start difference. First operand 240 states and 347 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:19:32,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:19:36,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:19:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:36,931 INFO L93 Difference]: Finished difference Result 412 states and 598 transitions. [2023-11-29 05:19:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:19:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2023-11-29 05:19:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:36,935 INFO L225 Difference]: With dead ends: 412 [2023-11-29 05:19:36,935 INFO L226 Difference]: Without dead ends: 240 [2023-11-29 05:19:36,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 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-29 05:19:36,937 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 16 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:36,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 203 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 05:19:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-11-29 05:19:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2023-11-29 05:19:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 158 states have (on average 1.2721518987341771) internal successors, (201), 158 states have internal predecessors, (201), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-29 05:19:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 345 transitions. [2023-11-29 05:19:36,962 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 345 transitions. Word has length 161 [2023-11-29 05:19:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:36,963 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 345 transitions. [2023-11-29 05:19:36,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 05:19:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 345 transitions. [2023-11-29 05:19:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:19:36,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:36,966 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:36,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:19:37,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:19:37,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:19:37,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1215041643, now seen corresponding path program 1 times [2023-11-29 05:19:37,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:19:37,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135147202] [2023-11-29 05:19:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:37,168 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-29 05:19:37,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:19:37,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:19:37,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773967ab-59ab-48bb-8229-74711e832a90/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 05:19:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:38,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 05:19:38,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:20:21,824 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:26,043 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (and (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 11 53))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)) (fp.div c_currentRoundingMode c_~var_1_10~0 ~var_1_26~0))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 05:20:34,802 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:43,511 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:52,216 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:00,144 WARN L293 SmtUtils]: Spent 7.69s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:08,849 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:17,574 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:26,329 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:35,570 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:39,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse10)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 11 53))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)) (fp.div c_currentRoundingMode c_~var_1_10~0 ~var_1_26~0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse6 (bvsgt .cse8 c_~var_1_14~0)) (.cse4 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse5 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse4 .cse5) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse5)))) (not .cse6)) (and .cse6 (let ((.cse7 (bvslt c_~last_1_var_1_15~0 .cse8))) (or (and (not .cse7) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse4 .cse7)))))))))) is different from false [2023-11-29 05:21:48,924 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:58,161 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:02,409 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse10)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (= c_~var_1_4~0 c_~var_1_1~0) (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 11 53))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)) (fp.div c_currentRoundingMode c_~var_1_10~0 ~var_1_26~0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse6 (bvsgt .cse8 c_~var_1_14~0)) (.cse4 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse5 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse4 .cse5) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse5)))) (not .cse6)) (and .cse6 (let ((.cse7 (bvslt c_~last_1_var_1_15~0 .cse8))) (or (and (not .cse7) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse4 .cse7)))))))))) is different from false [2023-11-29 05:22:11,619 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:18,121 WARN L293 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:27,344 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:36,614 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:40,863 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse10)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (= c_~var_1_4~0 c_~var_1_1~0) (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 11 53))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)) (fp.div c_currentRoundingMode c_~var_1_10~0 ~var_1_26~0))) (= c_~var_1_7~0 c_~var_1_5~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse6 (bvsgt .cse8 c_~var_1_14~0)) (.cse4 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse5 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse4 .cse5) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse5)))) (not .cse6)) (and .cse6 (let ((.cse7 (bvslt c_~last_1_var_1_15~0 .cse8))) (or (and (not .cse7) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse4 .cse7)))))))))) is different from false [2023-11-29 05:22:50,285 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:54,569 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse10)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (= c_~var_1_4~0 c_~var_1_1~0) (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= c_~var_1_15~0 c_~var_1_13~0) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 11 53))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)) (fp.div c_currentRoundingMode c_~var_1_10~0 ~var_1_26~0))) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (= c_~var_1_7~0 c_~var_1_5~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse6 (bvsgt .cse8 c_~var_1_14~0)) (.cse4 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse5 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse4 .cse5) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse5)))) (not .cse6)) (and .cse6 (let ((.cse7 (bvslt c_~last_1_var_1_15~0 .cse8))) (or (and (not .cse7) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse4 .cse7)))))))))) is different from false [2023-11-29 05:23:34,666 WARN L293 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:23:40,518 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse10)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (= c_~var_1_4~0 c_~var_1_1~0) (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= c_~var_1_15~0 c_~var_1_13~0) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 11 53))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)) (fp.div c_currentRoundingMode c_~var_1_10~0 ~var_1_26~0))) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (= c_~var_1_16~0 (fp.add c_currentRoundingMode c_~var_1_17~0 (fp.add c_currentRoundingMode c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0))))) (= c_~var_1_7~0 c_~var_1_5~0) (fp.geq c_~last_1_var_1_16~0 c_~var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse6 (bvsgt .cse8 c_~var_1_14~0)) (.cse4 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse5 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse4 .cse5) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse5)))) (not .cse6)) (and .cse6 (let ((.cse7 (bvslt c_~last_1_var_1_15~0 .cse8))) (or (and (not .cse7) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse4 .cse7)))))))))) is different from false [2023-11-29 05:24:29,027 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:24:34,759 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse10 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse9))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse10)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse9))) (and (= c_~var_1_4~0 c_~var_1_1~0) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 211.0 20.0))) c_~var_1_16~0) (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= c_~var_1_15~0 c_~var_1_13~0) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 11 53))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)) (fp.div c_currentRoundingMode c_~var_1_10~0 ~var_1_26~0))) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (= c_~var_1_16~0 (fp.add c_currentRoundingMode c_~var_1_17~0 (fp.add c_currentRoundingMode c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0))))) (= c_~var_1_7~0 c_~var_1_5~0) (fp.geq c_~last_1_var_1_16~0 c_~var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse6 (bvsgt .cse8 c_~var_1_14~0)) (.cse4 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse5 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse4 .cse5) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse5)))) (not .cse6)) (and .cse6 (let ((.cse7 (bvslt c_~last_1_var_1_15~0 .cse8))) (or (and (not .cse7) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse4 .cse7)))))))))) is different from false [2023-11-29 05:24:45,763 WARN L293 SmtUtils]: Spent 7.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:24:53,929 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:01,441 WARN L293 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:09,658 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:15,674 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:22,526 WARN L293 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:34,618 WARN L293 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:48,434 WARN L293 SmtUtils]: Spent 6.74s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:56,251 WARN L293 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:01,483 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:09,707 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:17,920 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:26,221 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:37,473 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:43,381 WARN L293 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:51,592 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:57,675 WARN L293 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:27:05,909 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:27:12,756 WARN L293 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:27:24,407 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:27:30,775 WARN L293 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:27:39,482 WARN L293 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:27:47,700 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:27:54,887 WARN L293 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:28:02,220 WARN L293 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:28:09,778 WARN L293 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:28:18,004 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:28:22,293 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse11 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse11))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse10))) (and (= c_~var_1_4~0 c_~var_1_1~0) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 211.0 20.0))) c_~var_1_16~0) (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= c_~var_1_15~0 c_~var_1_13~0) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 11 53))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)) (fp.div c_currentRoundingMode c_~var_1_10~0 ~var_1_26~0))) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (let ((.cse4 (fp.gt c_~var_1_7~0 c_~var_1_10~0))) (or (and .cse4 (= c_~var_1_7~0 c_~var_1_8~0)) (and (not .cse4) (= c_~var_1_8~0 c_~var_1_10~0)))) (= c_~var_1_16~0 (fp.add c_currentRoundingMode c_~var_1_17~0 (fp.add c_currentRoundingMode c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0))))) (= c_~var_1_7~0 c_~var_1_5~0) (fp.geq c_~last_1_var_1_16~0 c_~var_1_7~0) (fp.gt c_~var_1_16~0 (fp.mul c_currentRoundingMode c_~var_1_7~0 c_~var_1_16~0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse9 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse7 (bvsgt .cse9 c_~var_1_14~0)) (.cse5 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse6 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse5 .cse6) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse6)))) (not .cse7)) (and .cse7 (let ((.cse8 (bvslt c_~last_1_var_1_15~0 .cse9))) (or (and (not .cse8) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse5 .cse8)))))))))) is different from false [2023-11-29 05:28:26,334 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse11 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse11))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse10))) (and (= c_~var_1_4~0 c_~var_1_1~0) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 211.0 20.0))) c_~var_1_16~0) (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= c_~var_1_15~0 c_~var_1_13~0) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 11 53))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)) (fp.div c_currentRoundingMode c_~var_1_10~0 ~var_1_26~0))) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (let ((.cse4 (fp.gt c_~var_1_7~0 c_~var_1_10~0))) (or (and .cse4 (= c_~var_1_7~0 c_~var_1_8~0)) (and (not .cse4) (= c_~var_1_8~0 c_~var_1_10~0)))) (= c_~var_1_16~0 (fp.add c_currentRoundingMode c_~var_1_17~0 (fp.add c_currentRoundingMode c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0))))) (= c_~var_1_7~0 c_~var_1_5~0) (fp.geq c_~last_1_var_1_16~0 c_~var_1_7~0) (fp.gt c_~var_1_16~0 (fp.mul c_currentRoundingMode c_~var_1_7~0 c_~var_1_16~0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse9 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse7 (bvsgt .cse9 c_~var_1_14~0)) (.cse5 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse6 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse5 .cse6) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse6)))) (not .cse7)) (and .cse7 (let ((.cse8 (bvslt c_~last_1_var_1_15~0 .cse9))) (or (and (not .cse8) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse5 .cse8)))))))))) is different from true