./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 91502c696c3817feb6a83b9fc9ac9f8d3ae7404690c12bcf1fe920d76454d132 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:16:16,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:16:16,939 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:16:16,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:16:16,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:16:16,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:16:16,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:16:16,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:16:16,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:16:16,973 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:16:16,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:16:16,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:16:16,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:16:16,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:16:16,976 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:16:16,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:16:16,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:16:16,977 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:16:16,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:16:16,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:16:16,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:16:16,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:16:16,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:16:16,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:16:16,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:16:16,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:16:16,982 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:16:16,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:16:16,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:16:16,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:16:16,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:16:16,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:16:16,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:16:16,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:16:16,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:16:16,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:16:16,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:16:16,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:16:16,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:16:16,985 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:16:16,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:16:16,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:16:16,986 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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 -> 91502c696c3817feb6a83b9fc9ac9f8d3ae7404690c12bcf1fe920d76454d132 [2023-11-29 02:16:17,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:16:17,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:16:17,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:16:17,258 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:16:17,259 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:16:17,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i [2023-11-29 02:16:20,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:16:20,420 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:16:20,421 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i [2023-11-29 02:16:20,433 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/data/19864b34e/283b5846c73e46e5a411dc99172a72d7/FLAG12ad1a785 [2023-11-29 02:16:20,448 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/data/19864b34e/283b5846c73e46e5a411dc99172a72d7 [2023-11-29 02:16:20,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:16:20,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:16:20,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:16:20,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:16:20,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:16:20,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a20d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20, skipping insertion in model container [2023-11-29 02:16:20,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,509 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:16:20,670 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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i[917,930] [2023-11-29 02:16:20,742 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:16:20,757 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:16:20,773 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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i[917,930] [2023-11-29 02:16:20,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:16:20,830 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:16:20,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20 WrapperNode [2023-11-29 02:16:20,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:16:20,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:16:20,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:16:20,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:16:20,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,891 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2023-11-29 02:16:20,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:16:20,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:16:20,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:16:20,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:16:20,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,929 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 02:16:20,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:16:20,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:16:20,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:16:20,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:16:20,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (1/1) ... [2023-11-29 02:16:20,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:16:20,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:16:20,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:16:20,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:16:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:16:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:16:21,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:16:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:16:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:16:21,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:16:21,103 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:16:21,106 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:16:21,450 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:16:21,501 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:16:21,501 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:16:21,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:21 BoogieIcfgContainer [2023-11-29 02:16:21,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:16:21,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:16:21,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:16:21,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:16:21,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:16:20" (1/3) ... [2023-11-29 02:16:21,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0a3358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:16:21, skipping insertion in model container [2023-11-29 02:16:21,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:20" (2/3) ... [2023-11-29 02:16:21,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0a3358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:16:21, skipping insertion in model container [2023-11-29 02:16:21,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:21" (3/3) ... [2023-11-29 02:16:21,512 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-51.i [2023-11-29 02:16:21,560 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:16:21,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:16:21,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:16:21,630 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;@266d29b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:16:21,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:16:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 02:16:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-29 02:16:21,655 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:21,656 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:16:21,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:21,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1355258684, now seen corresponding path program 1 times [2023-11-29 02:16:21,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572440203] [2023-11-29 02:16:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:21,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:16:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:16:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:16:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 02:16:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:16:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:16:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 02:16:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 02:16:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 02:16:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:16:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:16:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 02:16:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 02:16:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 02:16:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:16:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:16:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:16:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:16:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 02:16:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 02:16:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 02:16:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 02:16:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 02:16:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 02:16:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 02:16:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2023-11-29 02:16:22,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572440203] [2023-11-29 02:16:22,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572440203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:22,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:22,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:16:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420433987] [2023-11-29 02:16:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:22,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:16:22,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:16:22,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:16:22,206 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 02:16:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:22,260 INFO L93 Difference]: Finished difference Result 147 states and 266 transitions. [2023-11-29 02:16:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:16:22,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 181 [2023-11-29 02:16:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:22,272 INFO L225 Difference]: With dead ends: 147 [2023-11-29 02:16:22,272 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 02:16:22,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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 02:16:22,281 INFO L413 NwaCegarLoop]: 111 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, 111 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 02:16:22,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:16:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 02:16:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-29 02:16:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 02:16:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2023-11-29 02:16:22,338 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 181 [2023-11-29 02:16:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:22,339 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2023-11-29 02:16:22,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 02:16:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2023-11-29 02:16:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-29 02:16:22,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:22,345 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:16:22,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:16:22,345 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:22,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash 143607556, now seen corresponding path program 1 times [2023-11-29 02:16:22,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:22,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760148860] [2023-11-29 02:16:22,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:16:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:16:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:16:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 02:16:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:16:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:16:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 02:16:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 02:16:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 02:16:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:16:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:16:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 02:16:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 02:16:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 02:16:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:16:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:16:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:16:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:16:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 02:16:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 02:16:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 02:16:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 02:16:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 02:16:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 02:16:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 02:16:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2023-11-29 02:16:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:22,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760148860] [2023-11-29 02:16:22,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760148860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:22,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:22,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:16:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384523076] [2023-11-29 02:16:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:22,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:16:22,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:22,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:16:22,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:22,677 INFO L87 Difference]: Start difference. First operand 73 states and 114 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-11-29 02:16:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:22,738 INFO L93 Difference]: Finished difference Result 190 states and 294 transitions. [2023-11-29 02:16:22,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:16:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 181 [2023-11-29 02:16:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:22,744 INFO L225 Difference]: With dead ends: 190 [2023-11-29 02:16:22,744 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 02:16:22,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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 02:16:22,747 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 63 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:22,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:16:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 02:16:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2023-11-29 02:16:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 02:16:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 178 transitions. [2023-11-29 02:16:22,779 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 178 transitions. Word has length 181 [2023-11-29 02:16:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:22,780 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 178 transitions. [2023-11-29 02:16:22,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-11-29 02:16:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 178 transitions. [2023-11-29 02:16:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-29 02:16:22,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:22,785 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:16:22,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:16:22,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:22,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1427922676, now seen corresponding path program 1 times [2023-11-29 02:16:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:22,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484124940] [2023-11-29 02:16:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:16:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:16:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 02:16:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 02:16:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:16:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:16:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 02:16:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 02:16:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 02:16:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:16:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:16:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 02:16:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 02:16:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 02:16:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:16:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:16:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:16:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:16:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 02:16:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 02:16:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 02:16:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 02:16:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 02:16:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 02:16:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 02:16:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2023-11-29 02:16:23,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:23,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484124940] [2023-11-29 02:16:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484124940] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:16:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484864825] [2023-11-29 02:16:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:23,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:16:23,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:16:23,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:16:23,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:16:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:23,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:16:23,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:16:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2023-11-29 02:16:23,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:16:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2023-11-29 02:16:24,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484864825] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:16:24,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:16:24,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-29 02:16:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991932042] [2023-11-29 02:16:24,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:16:24,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:16:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:16:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:16:24,090 INFO L87 Difference]: Start difference. First operand 115 states and 178 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2023-11-29 02:16:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:24,459 INFO L93 Difference]: Finished difference Result 241 states and 365 transitions. [2023-11-29 02:16:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:16:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) Word has length 182 [2023-11-29 02:16:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:24,465 INFO L225 Difference]: With dead ends: 241 [2023-11-29 02:16:24,466 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 02:16:24,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:16:24,469 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 124 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:24,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 157 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:16:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 02:16:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2023-11-29 02:16:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 72 states have internal predecessors, (88), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 02:16:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 182 transitions. [2023-11-29 02:16:24,506 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 182 transitions. Word has length 182 [2023-11-29 02:16:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:24,507 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 182 transitions. [2023-11-29 02:16:24,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2023-11-29 02:16:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 182 transitions. [2023-11-29 02:16:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-29 02:16:24,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:24,512 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:16:24,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:16:24,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:16:24,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:24,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:24,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2107981046, now seen corresponding path program 1 times [2023-11-29 02:16:24,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:24,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013462624] [2023-11-29 02:16:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:16:24,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:16:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:16:25,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:16:25,002 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:16:25,003 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:16:25,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:16:25,008 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 02:16:25,012 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:16:25,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:16:25 BoogieIcfgContainer [2023-11-29 02:16:25,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:16:25,123 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:16:25,123 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:16:25,123 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:16:25,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:21" (3/4) ... [2023-11-29 02:16:25,125 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:16:25,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:16:25,127 INFO L158 Benchmark]: Toolchain (without parser) took 4675.15ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 101.1MB in the beginning and 103.2MB in the end (delta: -2.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2023-11-29 02:16:25,128 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:16:25,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.24ms. Allocated memory is still 155.2MB. Free memory was 100.7MB in the beginning and 86.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 02:16:25,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.59ms. Allocated memory is still 155.2MB. Free memory was 86.9MB in the beginning and 83.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:16:25,129 INFO L158 Benchmark]: Boogie Preprocessor took 59.79ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 80.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:16:25,129 INFO L158 Benchmark]: RCFGBuilder took 548.86ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 58.3MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 02:16:25,130 INFO L158 Benchmark]: TraceAbstraction took 3617.27ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 57.5MB in the beginning and 103.2MB in the end (delta: -45.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2023-11-29 02:16:25,130 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 216.0MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:16:25,133 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.20ms. Allocated memory is still 109.1MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.24ms. Allocated memory is still 155.2MB. Free memory was 100.7MB in the beginning and 86.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.59ms. Allocated memory is still 155.2MB. Free memory was 86.9MB in the beginning and 83.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.79ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 80.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 548.86ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 58.3MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3617.27ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 57.5MB in the beginning and 103.2MB in the end (delta: -45.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 216.0MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] unsigned long int var_1_2 = 32; [L24] unsigned long int var_1_3 = 128; [L25] double var_1_4 = 32.3; [L26] double var_1_5 = 0.25; [L27] double var_1_6 = 500.6; [L28] unsigned char var_1_7 = 2; [L29] signed char var_1_8 = -10; [L30] signed char var_1_9 = 5; [L31] signed char var_1_10 = 4; [L32] signed char var_1_11 = 100; [L33] unsigned long int var_1_12 = 8; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L36] unsigned long int var_1_15 = 1114432789; [L37] unsigned long int var_1_16 = 2; [L38] double var_1_17 = 256.8; [L39] double var_1_18 = 1.25; [L40] unsigned long int var_1_19 = 16; [L41] unsigned char var_1_21 = 1; [L42] double var_1_22 = -0.5; [L43] unsigned char var_1_23 = 0; [L44] unsigned char var_1_24 = 1; [L156] isInitial = 1 [L157] FCALL initially() [L158] COND TRUE 1 [L159] FCALL updateLastVariables() [L160] CALL updateVariables() [L101] var_1_2 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_3 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L107] var_1_4 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L108] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L109] var_1_5 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L110] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L111] var_1_6 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L112] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L113] var_1_7 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L114] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L115] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=5] [L115] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=5] [L116] var_1_9 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L117] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L118] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L118] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L119] var_1_10 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L120] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L121] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L121] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L122] var_1_11 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L123] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L124] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L124] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L125] var_1_13 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L126] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L127] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L127] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L128] var_1_14 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L130] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L130] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L131] var_1_15 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L132] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L133] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L133] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L134] var_1_16 = __VERIFIER_nondet_ulong() [L135] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L135] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L136] CALL assume_abort_if_not(var_1_16 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L136] RET assume_abort_if_not(var_1_16 <= 1073741823) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L137] var_1_18 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L138] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L139] var_1_22 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L140] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L141] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L141] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L142] var_1_23 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L143] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L144] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L144] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L145] var_1_24 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L146] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L147] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L147] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L160] RET updateVariables() [L161] CALL step() [L48] unsigned long int stepLocal_1 = var_1_2; [L49] unsigned long int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=0, var_1_8=-10, var_1_9=126] [L50] COND FALSE !(32u >= stepLocal_0) [L57] var_1_1 = var_1_7 VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=0, var_1_8=-10, var_1_9=126] [L59] COND TRUE ! (var_1_6 > var_1_5) [L60] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=0, var_1_8=125, var_1_9=126] [L64] unsigned char stepLocal_2 = var_1_13; VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, stepLocal_2=1, var_1_10=126, var_1_11=1, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=0, var_1_8=125, var_1_9=126] [L65] COND TRUE stepLocal_2 && var_1_14 [L66] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, stepLocal_2=1, var_1_10=126, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=0, var_1_8=125, var_1_9=126] [L72] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, stepLocal_2=1, var_1_10=126, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=0, var_1_8=125, var_1_9=126] [L75] unsigned char stepLocal_3 = ((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18; VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, stepLocal_2=1, stepLocal_3=1, var_1_10=126, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=0, var_1_8=125, var_1_9=126] [L76] COND TRUE var_1_14 || stepLocal_3 VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, stepLocal_2=1, stepLocal_3=1, var_1_10=126, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=0, var_1_8=125, var_1_9=126] [L77] COND TRUE var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) [L78] var_1_19 = var_1_16 VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, stepLocal_2=1, stepLocal_3=1, var_1_10=126, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=0, var_1_8=125, var_1_9=126] [L85] unsigned long int stepLocal_4 = var_1_3; VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, stepLocal_2=1, stepLocal_3=1, stepLocal_4=34, var_1_10=126, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_3=34, var_1_7=0, var_1_8=125, var_1_9=126] [L86] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L97] var_1_21 = var_1_23 VAL [isInitial=1, stepLocal_0=33, stepLocal_1=33, stepLocal_2=1, stepLocal_3=1, stepLocal_4=34, var_1_10=126, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_2=33, var_1_3=34, var_1_7=0, var_1_8=125, var_1_9=126] [L161] RET step() [L162] CALL, EXPR property() [L152-L153] return ((((((32u >= var_1_2) ? ((var_1_2 <= var_1_3) ? (((var_1_4 - var_1_5) >= var_1_6) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_6 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_13 && var_1_14) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_13 ? (var_1_12 == ((unsigned long int) (((((var_1_1) > ((var_1_11 + var_1_7))) ? (var_1_1) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_16)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((var_1_14 || (((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18)) ? ((var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) ? (var_1_19 == ((unsigned long int) var_1_16)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) var_1_16)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_2 < var_1_3) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L162] RET, EXPR property() [L162] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_2=33, var_1_3=34, var_1_7=0, var_1_8=125, var_1_9=126] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2147483647, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_2=33, var_1_3=34, var_1_7=0, var_1_8=125, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 483 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 189 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 187 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 294 mSDtfsCounter, 187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 903 ConstructedInterpolants, 0 QuantifiedInterpolants, 1338 SizeOfPredicates, 4 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 8556/8700 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 02:16:25,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 91502c696c3817feb6a83b9fc9ac9f8d3ae7404690c12bcf1fe920d76454d132 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:16:27,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:16:27,413 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 02:16:27,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:16:27,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:16:27,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:16:27,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:16:27,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:16:27,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:16:27,453 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:16:27,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:16:27,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:16:27,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:16:27,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:16:27,458 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:16:27,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:16:27,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:16:27,460 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:16:27,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:16:27,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:16:27,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:16:27,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:16:27,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:16:27,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:16:27,464 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:16:27,465 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:16:27,465 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:16:27,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:16:27,466 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:16:27,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:16:27,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:16:27,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:16:27,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:16:27,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:16:27,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:16:27,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:16:27,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:16:27,469 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:16:27,469 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:16:27,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:16:27,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:16:27,470 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:16:27,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:16:27,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:16:27,471 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:16:27,471 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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 -> 91502c696c3817feb6a83b9fc9ac9f8d3ae7404690c12bcf1fe920d76454d132 [2023-11-29 02:16:27,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:16:27,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:16:27,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:16:27,830 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:16:27,830 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:16:27,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i [2023-11-29 02:16:30,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:16:31,035 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:16:31,036 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i [2023-11-29 02:16:31,048 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/data/f7ac0a9ee/cb73c2c1ea8649b7850d6268bbb157ca/FLAG0d146d2b7 [2023-11-29 02:16:31,063 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/data/f7ac0a9ee/cb73c2c1ea8649b7850d6268bbb157ca [2023-11-29 02:16:31,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:16:31,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:16:31,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:16:31,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:16:31,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:16:31,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640d49ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31, skipping insertion in model container [2023-11-29 02:16:31,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,113 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:16:31,259 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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i[917,930] [2023-11-29 02:16:31,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:16:31,344 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:16:31,356 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_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i[917,930] [2023-11-29 02:16:31,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:16:31,416 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:16:31,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31 WrapperNode [2023-11-29 02:16:31,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:16:31,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:16:31,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:16:31,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:16:31,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,478 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2023-11-29 02:16:31,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:16:31,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:16:31,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:16:31,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:16:31,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,518 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 02:16:31,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:16:31,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:16:31,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:16:31,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:16:31,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (1/1) ... [2023-11-29 02:16:31,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:16:31,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:16:31,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:16:31,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:16:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:16:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:16:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:16:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:16:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:16:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:16:31,760 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:16:31,763 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:16:45,328 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:16:45,377 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:16:45,377 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:16:45,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:45 BoogieIcfgContainer [2023-11-29 02:16:45,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:16:45,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:16:45,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:16:45,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:16:45,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:16:31" (1/3) ... [2023-11-29 02:16:45,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1faf9bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:16:45, skipping insertion in model container [2023-11-29 02:16:45,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:31" (2/3) ... [2023-11-29 02:16:45,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1faf9bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:16:45, skipping insertion in model container [2023-11-29 02:16:45,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:45" (3/3) ... [2023-11-29 02:16:45,386 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-51.i [2023-11-29 02:16:45,403 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:16:45,404 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:16:45,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:16:45,456 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;@7ff8b3cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:16:45,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:16:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 02:16:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-29 02:16:45,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:45,478 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:16:45,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:45,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1355258684, now seen corresponding path program 1 times [2023-11-29 02:16:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:16:45,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444660505] [2023-11-29 02:16:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:45,498 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 02:16:45,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:16:45,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:16:45,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:16:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 02:16:46,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:16:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2023-11-29 02:16:46,629 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:16:46,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:16:46,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444660505] [2023-11-29 02:16:46,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444660505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:46,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:46,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:16:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625862934] [2023-11-29 02:16:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:46,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:16:46,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:16:46,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:16:46,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:16:46,673 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 02:16:51,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:16:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:51,525 INFO L93 Difference]: Finished difference Result 147 states and 266 transitions. [2023-11-29 02:16:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:16:51,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 181 [2023-11-29 02:16:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:51,775 INFO L225 Difference]: With dead ends: 147 [2023-11-29 02:16:51,775 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 02:16:51,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 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 02:16:51,783 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 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.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:51,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2023-11-29 02:16:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 02:16:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-29 02:16:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 02:16:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2023-11-29 02:16:51,838 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 181 [2023-11-29 02:16:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:51,839 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2023-11-29 02:16:51,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 02:16:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2023-11-29 02:16:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-29 02:16:51,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:51,845 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:16:51,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:16:52,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:16:52,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:52,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash 143607556, now seen corresponding path program 1 times [2023-11-29 02:16:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:16:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592016955] [2023-11-29 02:16:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:52,050 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 02:16:52,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:16:52,051 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:16:52,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:16:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:53,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:16:53,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:16:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2023-11-29 02:16:54,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:16:54,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:16:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592016955] [2023-11-29 02:16:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592016955] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:16:54,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [577297196] [2023-11-29 02:16:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:54,509 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:16:54,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:16:54,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:16:54,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-11-29 02:16:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:55,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:16:55,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:16:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2023-11-29 02:16:55,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:16:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [577297196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:55,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:16:55,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-29 02:16:55,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364254887] [2023-11-29 02:16:55,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:55,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:16:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:16:55,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:16:55,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:55,124 INFO L87 Difference]: Start difference. First operand 73 states and 114 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-11-29 02:17:00,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:17:04,067 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 02:17:08,072 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 02:17:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:08,336 INFO L93 Difference]: Finished difference Result 190 states and 294 transitions. [2023-11-29 02:17:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:17:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 181 [2023-11-29 02:17:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:08,341 INFO L225 Difference]: With dead ends: 190 [2023-11-29 02:17:08,341 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 02:17:08,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:17:08,345 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 63 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:08,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 214 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 13.2s Time] [2023-11-29 02:17:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 02:17:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2023-11-29 02:17:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 02:17:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 178 transitions. [2023-11-29 02:17:08,381 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 178 transitions. Word has length 181 [2023-11-29 02:17:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:08,383 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 178 transitions. [2023-11-29 02:17:08,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-11-29 02:17:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 178 transitions. [2023-11-29 02:17:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-29 02:17:08,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:08,389 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:17:08,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2023-11-29 02:17:08,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:17:08,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:17:08,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:17:08,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1427922676, now seen corresponding path program 1 times [2023-11-29 02:17:08,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:17:08,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170243034] [2023-11-29 02:17:08,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:08,794 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 02:17:08,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:17:08,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:17:08,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:17:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:09,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:17:09,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:17:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2023-11-29 02:17:10,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:17:11,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:17:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170243034] [2023-11-29 02:17:11,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170243034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:17:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2034764859] [2023-11-29 02:17:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:11,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:17:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:17:11,186 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:17:11,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-11-29 02:17:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:13,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:17:13,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:17:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2023-11-29 02:17:14,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:17:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2034764859] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:17:14,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:17:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-11-29 02:17:14,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79851131] [2023-11-29 02:17:14,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:17:14,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:17:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:17:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:17:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:17:14,473 INFO L87 Difference]: Start difference. First operand 115 states and 178 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 02:17:20,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:17:24,717 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 02:17:28,722 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 02:17:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:28,730 INFO L93 Difference]: Finished difference Result 241 states and 365 transitions. [2023-11-29 02:17:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:17:28,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 182 [2023-11-29 02:17:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:28,988 INFO L225 Difference]: With dead ends: 241 [2023-11-29 02:17:28,989 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 02:17:28,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:17:28,991 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 54 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:28,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 159 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 168 Invalid, 3 Unknown, 0 Unchecked, 14.0s Time] [2023-11-29 02:17:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 02:17:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2023-11-29 02:17:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 72 states have internal predecessors, (88), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 02:17:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 182 transitions. [2023-11-29 02:17:29,018 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 182 transitions. Word has length 182 [2023-11-29 02:17:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:29,019 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 182 transitions. [2023-11-29 02:17:29,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-29 02:17:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 182 transitions. [2023-11-29 02:17:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-29 02:17:29,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:29,025 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:17:29,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:17:29,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-11-29 02:17:29,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:17:29,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:17:29,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:29,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2107981046, now seen corresponding path program 1 times [2023-11-29 02:17:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:17:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992197914] [2023-11-29 02:17:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:29,433 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 02:17:29,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:17:29,435 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:17:29,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba6f6f4-bac2-49c0-9769-9e47c6eac4d7/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 02:17:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:30,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 02:17:30,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:17:47,252 WARN L293 SmtUtils]: Spent 9.77s 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 02:17:56,969 WARN L293 SmtUtils]: Spent 9.72s 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 02:18:06,706 WARN L293 SmtUtils]: Spent 9.74s 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 02:18:16,440 WARN L293 SmtUtils]: Spent 9.73s 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 02:18:26,174 WARN L293 SmtUtils]: Spent 9.73s 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 02:18:35,948 WARN L293 SmtUtils]: Spent 9.77s 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 02:18:44,259 WARN L293 SmtUtils]: Spent 8.31s 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 02:18:54,093 WARN L293 SmtUtils]: Spent 9.83s 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 02:19:03,846 WARN L293 SmtUtils]: Spent 9.75s 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 02:19:12,371 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:19:22,138 WARN L293 SmtUtils]: Spent 9.77s 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 02:19:31,916 WARN L293 SmtUtils]: Spent 9.78s 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 02:19:41,795 WARN L293 SmtUtils]: Spent 9.88s 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 02:19:51,595 WARN L293 SmtUtils]: Spent 9.80s 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 02:20:01,322 WARN L293 SmtUtils]: Spent 9.73s 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 02:20:11,024 WARN L293 SmtUtils]: Spent 9.70s 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 02:20:20,851 WARN L293 SmtUtils]: Spent 9.83s 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 02:20:30,558 WARN L293 SmtUtils]: Spent 9.71s 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 02:20:40,289 WARN L293 SmtUtils]: Spent 9.73s 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 02:20:50,068 WARN L293 SmtUtils]: Spent 9.78s 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 02:20:59,896 WARN L293 SmtUtils]: Spent 9.83s 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 02:21:04,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 2.0)))) (let ((.cse7 (fp.gt .cse8 c_~var_1_22~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 2.0))) (.cse5 ((_ sign_extend 24) c_~var_1_11~0))) (and (= c_~var_1_19~0 c_~var_1_16~0) (bvsle ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (= c_~var_1_23~0 c_~var_1_21~0) (let ((.cse0 (fp.lt c_~var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (or (and (fp.gt c_~var_1_18~0 (fp.neg c_~var_1_17~0)) .cse0) (and (fp.gt c_~var_1_18~0 c_~var_1_17~0) (not .cse0)))) (= c_~var_1_7~0 c_~var_1_1~0) (let ((.cse4 ((_ sign_extend 24) c_~var_1_9~0)) (.cse3 ((_ sign_extend 24) c_~var_1_10~0))) (let ((.cse2 (bvneg .cse5)) (.cse1 (bvslt .cse4 .cse3))) (or (and (not .cse1) (= ((_ extract 7 0) (bvadd .cse2 .cse3)) c_~var_1_8~0)) (and (= ((_ extract 7 0) (bvadd .cse4 .cse2)) c_~var_1_8~0) .cse1)))) (not (= (_ bv0 8) c_~var_1_14~0)) (= c_~var_1_12~0 .cse5) (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_18~0 c_~var_1_22~0) .cse6)) .cse7) (or (not .cse7) (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_18~0 .cse8) .cse6))) (bvsge .cse5 (_ bv0 32)) (not (= c_~var_1_13~0 (_ bv0 8))) (not (fp.gt c_~var_1_6~0 c_~var_1_5~0))))) is different from false [2023-11-29 02:21:08,731 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 2.0)))) (let ((.cse7 (fp.gt .cse8 c_~var_1_22~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 2.0))) (.cse5 ((_ sign_extend 24) c_~var_1_11~0))) (and (= c_~var_1_19~0 c_~var_1_16~0) (bvsle ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (= c_~var_1_23~0 c_~var_1_21~0) (let ((.cse0 (fp.lt c_~var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (or (and (fp.gt c_~var_1_18~0 (fp.neg c_~var_1_17~0)) .cse0) (and (fp.gt c_~var_1_18~0 c_~var_1_17~0) (not .cse0)))) (= c_~var_1_7~0 c_~var_1_1~0) (let ((.cse4 ((_ sign_extend 24) c_~var_1_9~0)) (.cse3 ((_ sign_extend 24) c_~var_1_10~0))) (let ((.cse2 (bvneg .cse5)) (.cse1 (bvslt .cse4 .cse3))) (or (and (not .cse1) (= ((_ extract 7 0) (bvadd .cse2 .cse3)) c_~var_1_8~0)) (and (= ((_ extract 7 0) (bvadd .cse4 .cse2)) c_~var_1_8~0) .cse1)))) (not (= (_ bv0 8) c_~var_1_14~0)) (= c_~var_1_12~0 .cse5) (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_18~0 c_~var_1_22~0) .cse6)) .cse7) (or (not .cse7) (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_18~0 .cse8) .cse6))) (bvsge .cse5 (_ bv0 32)) (not (= c_~var_1_13~0 (_ bv0 8))) (not (fp.gt c_~var_1_6~0 c_~var_1_5~0))))) is different from true