./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.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_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/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_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/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_06e260fd-2a36-490c-a9d0-bc4d61063379/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 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:10:09,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:10:09,259 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:10:09,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:10:09,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:10:09,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:10:09,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:10:09,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:10:09,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:10:09,292 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:10:09,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:10:09,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:10:09,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:10:09,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:10:09,295 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:10:09,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:10:09,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:10:09,296 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:10:09,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:10:09,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:10:09,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:10:09,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:10:09,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:10:09,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:10:09,299 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:10:09,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:10:09,300 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:10:09,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:10:09,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:10:09,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:10:09,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:10:09,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:10:09,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:10:09,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:10:09,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:10:09,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:10:09,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:10:09,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:10:09,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:10:09,305 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:10:09,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:10:09,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:10:09,306 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_06e260fd-2a36-490c-a9d0-bc4d61063379/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_06e260fd-2a36-490c-a9d0-bc4d61063379/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 -> 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae [2023-11-29 01:10:09,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:10:09,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:10:09,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:10:09,576 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:10:09,576 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:10:09,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2023-11-29 01:10:12,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:10:12,579 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:10:12,580 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2023-11-29 01:10:12,587 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/data/ecc2b4c8d/3e2d32c2ffad4392820ff26e2b15f898/FLAG1972d8faf [2023-11-29 01:10:12,598 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/data/ecc2b4c8d/3e2d32c2ffad4392820ff26e2b15f898 [2023-11-29 01:10:12,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:10:12,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:10:12,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:10:12,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:10:12,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:10:12,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8351a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12, skipping insertion in model container [2023-11-29 01:10:12,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,637 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:10:12,764 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_06e260fd-2a36-490c-a9d0-bc4d61063379/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i[916,929] [2023-11-29 01:10:12,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:10:12,819 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:10:12,830 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_06e260fd-2a36-490c-a9d0-bc4d61063379/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i[916,929] [2023-11-29 01:10:12,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:10:12,872 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:10:12,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12 WrapperNode [2023-11-29 01:10:12,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:10:12,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:10:12,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:10:12,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:10:12,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,921 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2023-11-29 01:10:12,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:10:12,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:10:12,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:10:12,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:10:12,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,952 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 01:10:12,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:10:12,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:10:12,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:10:12,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:10:12,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (1/1) ... [2023-11-29 01:10:12,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:10:12,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:13,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:13,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:10:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:10:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:10:13,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:10:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:10:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:10:13,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:10:13,120 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:10:13,122 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:10:13,374 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:10:13,415 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:10:13,416 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:10:13,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:10:13 BoogieIcfgContainer [2023-11-29 01:10:13,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:10:13,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:10:13,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:10:13,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:10:13,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:10:12" (1/3) ... [2023-11-29 01:10:13,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d935576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:10:13, skipping insertion in model container [2023-11-29 01:10:13,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:12" (2/3) ... [2023-11-29 01:10:13,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d935576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:10:13, skipping insertion in model container [2023-11-29 01:10:13,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:10:13" (3/3) ... [2023-11-29 01:10:13,426 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-88.i [2023-11-29 01:10:13,446 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:10:13,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:10:13,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:10:13,495 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;@5af8a94d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:10:13,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:10:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 01:10:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 01:10:13,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:13,515 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:13,516 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:13,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash 626528525, now seen corresponding path program 1 times [2023-11-29 01:10:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:13,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595962729] [2023-11-29 01:10:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:10:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:10:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:10:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:10:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:10:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:10:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:10:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:10:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:10:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:10:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:10:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:10:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:10:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:10:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:10:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:10:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:10:13,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595962729] [2023-11-29 01:10:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595962729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:10:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869103423] [2023-11-29 01:10:13,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:13,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:10:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:13,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:10:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:10:13,932 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 01:10:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:13,975 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2023-11-29 01:10:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:10:13,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2023-11-29 01:10:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:13,986 INFO L225 Difference]: With dead ends: 99 [2023-11-29 01:10:13,986 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 01:10:13,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:10:13,994 INFO L413 NwaCegarLoop]: 72 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, 72 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 01:10:13,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:10:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 01:10:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 01:10:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 01:10:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-11-29 01:10:14,042 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 112 [2023-11-29 01:10:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:14,042 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-11-29 01:10:14,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 01:10:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-11-29 01:10:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 01:10:14,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:14,047 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:14,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:10:14,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:14,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:14,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1281864269, now seen corresponding path program 1 times [2023-11-29 01:10:14,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016441909] [2023-11-29 01:10:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:10:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:10:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:10:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:10:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:10:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:10:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:10:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:10:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:10:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:10:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:10:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:10:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:10:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:10:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:10:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:10:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:10:14,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:14,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016441909] [2023-11-29 01:10:14,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016441909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:14,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:14,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:10:14,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623603103] [2023-11-29 01:10:14,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:14,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:10:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:10:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:10:14,860 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:15,110 INFO L93 Difference]: Finished difference Result 146 states and 224 transitions. [2023-11-29 01:10:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:10:15,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-11-29 01:10:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:15,114 INFO L225 Difference]: With dead ends: 146 [2023-11-29 01:10:15,114 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 01:10:15,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:10:15,117 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:15,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 196 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:10:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 01:10:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-11-29 01:10:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 01:10:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2023-11-29 01:10:15,156 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 112 [2023-11-29 01:10:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:15,157 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2023-11-29 01:10:15,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2023-11-29 01:10:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:10:15,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:15,160 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:15,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:10:15,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:15,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash -810944936, now seen corresponding path program 1 times [2023-11-29 01:10:15,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:15,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560949335] [2023-11-29 01:10:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:10:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:10:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:10:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:10:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:10:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:10:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:10:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:10:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:10:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:10:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:10:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:10:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:10:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:10:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:10:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:10:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:10:15,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:15,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560949335] [2023-11-29 01:10:15,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560949335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:15,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:15,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:10:15,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835400634] [2023-11-29 01:10:15,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:15,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:10:15,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:15,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:10:15,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:15,325 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:15,377 INFO L93 Difference]: Finished difference Result 162 states and 249 transitions. [2023-11-29 01:10:15,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:10:15,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-29 01:10:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:15,380 INFO L225 Difference]: With dead ends: 162 [2023-11-29 01:10:15,381 INFO L226 Difference]: Without dead ends: 114 [2023-11-29 01:10:15,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:10:15,383 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:15,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 134 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:10:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-29 01:10:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-11-29 01:10:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 01:10:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 168 transitions. [2023-11-29 01:10:15,414 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 168 transitions. Word has length 114 [2023-11-29 01:10:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:15,415 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 168 transitions. [2023-11-29 01:10:15,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 168 transitions. [2023-11-29 01:10:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:10:15,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:15,418 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:15,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:10:15,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:15,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash -811004518, now seen corresponding path program 1 times [2023-11-29 01:10:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372729026] [2023-11-29 01:10:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:10:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:10:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:10:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:10:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:10:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:10:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:10:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:10:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:10:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:10:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:10:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:10:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:10:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:10:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:10:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:10:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:10:15,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:15,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372729026] [2023-11-29 01:10:15,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372729026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:15,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:15,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:10:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413907532] [2023-11-29 01:10:15,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:15,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:10:15,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:15,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:10:15,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:10:15,749 INFO L87 Difference]: Start difference. First operand 108 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:15,925 INFO L93 Difference]: Finished difference Result 172 states and 265 transitions. [2023-11-29 01:10:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:10:15,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-29 01:10:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:15,929 INFO L225 Difference]: With dead ends: 172 [2023-11-29 01:10:15,929 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 01:10:15,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:10:15,931 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:15,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 200 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:10:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 01:10:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2023-11-29 01:10:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 01:10:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2023-11-29 01:10:15,963 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 114 [2023-11-29 01:10:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:15,964 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2023-11-29 01:10:15,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2023-11-29 01:10:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:10:15,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:15,967 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:15,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:10:15,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:15,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash -552779498, now seen corresponding path program 1 times [2023-11-29 01:10:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011950194] [2023-11-29 01:10:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:10:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:10:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:10:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:10:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:10:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:10:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:10:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:10:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:10:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:10:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:10:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:10:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:10:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:10:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:10:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:10:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:10:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:16,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011950194] [2023-11-29 01:10:16,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011950194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:16,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:16,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:10:16,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963762029] [2023-11-29 01:10:16,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:16,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:10:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:16,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:16,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:16,500 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:16,869 INFO L93 Difference]: Finished difference Result 201 states and 299 transitions. [2023-11-29 01:10:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:10:16,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-29 01:10:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:16,872 INFO L225 Difference]: With dead ends: 201 [2023-11-29 01:10:16,872 INFO L226 Difference]: Without dead ends: 138 [2023-11-29 01:10:16,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:10:16,874 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:16,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 296 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:10:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-29 01:10:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2023-11-29 01:10:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 01:10:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2023-11-29 01:10:16,905 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 114 [2023-11-29 01:10:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:16,906 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2023-11-29 01:10:16,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2023-11-29 01:10:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:10:16,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:16,908 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:16,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:10:16,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:16,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash -945806508, now seen corresponding path program 1 times [2023-11-29 01:10:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185664487] [2023-11-29 01:10:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:10:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:10:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:10:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:10:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:10:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:10:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:10:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:10:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:10:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:10:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:10:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:10:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:10:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:10:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:10:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:10:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:10:21,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185664487] [2023-11-29 01:10:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185664487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:10:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591075513] [2023-11-29 01:10:21,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:21,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:21,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:21,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:21,717 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:22,706 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2023-11-29 01:10:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:10:22,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-29 01:10:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:22,711 INFO L225 Difference]: With dead ends: 121 [2023-11-29 01:10:22,711 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 01:10:22,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:10:22,713 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 58 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:22,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 268 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:10:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 01:10:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2023-11-29 01:10:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 01:10:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2023-11-29 01:10:22,733 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 114 [2023-11-29 01:10:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:22,734 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2023-11-29 01:10:22,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2023-11-29 01:10:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:10:22,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:22,736 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:22,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:10:22,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:10:22,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash 829200854, now seen corresponding path program 1 times [2023-11-29 01:10:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:22,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375435732] [2023-11-29 01:10:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:10:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:10:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:10:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:10:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:10:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:10:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:10:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:10:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:10:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:10:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:10:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:10:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:10:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:10:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:10:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:10:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:10:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:10:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:10:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375435732] [2023-11-29 01:10:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375435732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:26,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:26,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:10:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621706651] [2023-11-29 01:10:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:26,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:10:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:10:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:10:26,713 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:27,526 INFO L93 Difference]: Finished difference Result 117 states and 173 transitions. [2023-11-29 01:10:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:10:27,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-29 01:10:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:27,527 INFO L225 Difference]: With dead ends: 117 [2023-11-29 01:10:27,527 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 01:10:27,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:10:27,528 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 28 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:27,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 256 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:10:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 01:10:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 01:10:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:10:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 01:10:27,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2023-11-29 01:10:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:27,530 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 01:10:27,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:10:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 01:10:27,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 01:10:27,533 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:10:27,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:10:27,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 01:10:28,436 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-11-29 01:10:28,436 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 01:10:28,436 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 01:10:28,436 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 01:10:28,437 INFO L902 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: true [2023-11-29 01:10:28,437 INFO L902 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: true [2023-11-29 01:10:28,437 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-11-29 01:10:28,439 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 116) the Hoare annotation is: (let ((.cse0 (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)))) (or (and .cse0 (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1)) (let ((.cse8 (* (div ~var_1_12~0 4294967296) 4294967296)) (.cse13 (+ ~var_1_8~0 1)) (.cse14 (= ~var_1_9~0 ~var_1_7~0)) (.cse4 (* (div ~var_1_10~0 4294967296) 4294967296)) (.cse11 (* 4294967295 ~var_1_13~0))) (let ((.cse1 (* 256 (div ~var_1_19~0 256))) (.cse7 (+ (* (div ~var_1_13~0 4294967296) 4294967296) ~var_1_12~0)) (.cse6 (or (and (<= .cse13 ~var_1_9~0) .cse14) (= (+ (* (div (+ .cse11 ~var_1_11~0) 4294967296) 4294967296) ~var_1_10~0) (+ .cse4 .cse11 ~var_1_11~0)))) (.cse2 (not .cse14)) (.cse3 (< ~var_1_1~0 .cse13)) (.cse12 (< (+ .cse8 ~var_1_8~0) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_12~0)))) (and (= ~var_1_1~0 ~var_1_7~0) (= (+ (* (div ~var_1_18~0 256) 256) ~var_1_19~0) (+ ~var_1_18~0 .cse1)) (or (and (or .cse2 .cse3 (let ((.cse5 (* 4294967295 ~var_1_12~0))) (= (+ .cse4 ~var_1_11~0 .cse5 1) (+ ~var_1_10~0 (* 4294967296 (div (+ ~var_1_11~0 .cse5 1) 4294967296)))))) .cse6) (< .cse7 (+ .cse8 ~var_1_13~0 1))) (<= .cse1 ~var_1_18~0) (or .cse0 (and (or (< ~var_1_9~0 ~var_1_7~0) (let ((.cse9 (* (div ~var_1_9~0 256) 256))) (and (or (= (+ .cse9 256 ~var_1_8~0) ~var_1_9~0) (< ~var_1_9~0 (+ .cse9 128))) (or (< (+ .cse9 127) ~var_1_9~0) (= (+ .cse9 ~var_1_8~0) ~var_1_9~0))))) (or (let ((.cse10 (* (div ~var_1_7~0 256) 256))) (and (or (< (+ 127 .cse10) ~var_1_7~0) (= (+ ~var_1_8~0 .cse10) ~var_1_7~0)) (or (= (+ 256 ~var_1_8~0 .cse10) ~var_1_7~0) (< ~var_1_7~0 (+ 128 .cse10))))) (< ~var_1_7~0 (+ ~var_1_9~0 1))))) (or (< (+ .cse8 ~var_1_13~0) .cse7) (and .cse6 (or .cse2 .cse3 (= (+ .cse4 .cse11 ~var_1_11~0 1) (+ (* 4294967296 (div (+ .cse11 ~var_1_11~0 1) 4294967296)) ~var_1_10~0))))) (or (< ~var_1_8~0 0) (= ~var_1_8~0 ~var_1_14~0) .cse12) (or (= (+ ~var_1_8~0 ~var_1_14~0) 0) (< 0 .cse13) .cse12) (= 2 ~var_1_15~0) (= ~var_1_17~0 ~var_1_16~0)))))) [2023-11-29 01:10:28,439 INFO L899 garLoopResultBuilder]: For program point L110-3(lines 110 116) no Hoare annotation was computed. [2023-11-29 01:10:28,439 INFO L899 garLoopResultBuilder]: For program point L44-2(line 44) no Hoare annotation was computed. [2023-11-29 01:10:28,439 INFO L899 garLoopResultBuilder]: For program point L44-4(lines 44 52) no Hoare annotation was computed. [2023-11-29 01:10:28,439 INFO L899 garLoopResultBuilder]: For program point L44-5(lines 43 68) no Hoare annotation was computed. [2023-11-29 01:10:28,439 INFO L902 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: true [2023-11-29 01:10:28,439 INFO L902 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: true [2023-11-29 01:10:28,439 INFO L899 garLoopResultBuilder]: For program point L53-1(lines 43 68) no Hoare annotation was computed. [2023-11-29 01:10:28,440 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-29 01:10:28,440 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2023-11-29 01:10:28,440 INFO L902 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: true [2023-11-29 01:10:28,440 INFO L902 garLoopResultBuilder]: At program point L95-1(line 95) the Hoare annotation is: true [2023-11-29 01:10:28,440 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-29 01:10:28,440 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 01:10:28,440 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2023-11-29 01:10:28,440 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-11-29 01:10:28,441 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-11-29 01:10:28,441 INFO L899 garLoopResultBuilder]: For program point L104-2(line 104) no Hoare annotation was computed. [2023-11-29 01:10:28,441 INFO L899 garLoopResultBuilder]: For program point L104-4(line 104) no Hoare annotation was computed. [2023-11-29 01:10:28,441 INFO L899 garLoopResultBuilder]: For program point L96(lines 69 97) no Hoare annotation was computed. [2023-11-29 01:10:28,441 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 67) no Hoare annotation was computed. [2023-11-29 01:10:28,441 INFO L902 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: true [2023-11-29 01:10:28,441 INFO L902 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: true [2023-11-29 01:10:28,441 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-29 01:10:28,442 INFO L902 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: true [2023-11-29 01:10:28,442 INFO L902 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: true [2023-11-29 01:10:28,442 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 56 58) no Hoare annotation was computed. [2023-11-29 01:10:28,442 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-11-29 01:10:28,442 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-29 01:10:28,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 01:10:28,442 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-11-29 01:10:28,443 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (or (= ~var_1_1~0 ~var_1_7~0) (and (= (+ 16 ~var_1_15~0) 0) (<= (+ (div ~last_1_var_1_15~0 4294967296) 1) 0) (= 25 ~var_1_10~0) (<= ~last_1_var_1_10~0 (+ 41 ~last_1_var_1_15~0)) (<= 0 (div ~last_1_var_1_18~0 256)) (<= 25 ~last_1_var_1_10~0) (= ~var_1_18~0 0) (< ~last_1_var_1_18~0 1))) [2023-11-29 01:10:28,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 01:10:28,443 INFO L902 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: true [2023-11-29 01:10:28,443 INFO L902 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: true [2023-11-29 01:10:28,443 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-29 01:10:28,443 INFO L902 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: true [2023-11-29 01:10:28,443 INFO L902 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: true [2023-11-29 01:10:28,443 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-11-29 01:10:28,443 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 68) no Hoare annotation was computed. [2023-11-29 01:10:28,443 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 01:10:28,444 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 01:10:28,444 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 01:10:28,444 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 01:10:28,447 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:28,449 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:10:28,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:10:28 BoogieIcfgContainer [2023-11-29 01:10:28,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:10:28,468 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:10:28,468 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:10:28,468 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:10:28,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:10:13" (3/4) ... [2023-11-29 01:10:28,470 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 01:10:28,474 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 01:10:28,481 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-29 01:10:28,481 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 01:10:28,481 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 01:10:28,482 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 01:10:28,592 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:10:28,593 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 01:10:28,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:10:28,594 INFO L158 Benchmark]: Toolchain (without parser) took 15991.31ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 110.7MB in the beginning and 239.2MB in the end (delta: -128.4MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2023-11-29 01:10:28,594 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:10:28,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.74ms. Allocated memory is still 148.9MB. Free memory was 110.7MB in the beginning and 98.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:10:28,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.26ms. Allocated memory is still 148.9MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:10:28,595 INFO L158 Benchmark]: Boogie Preprocessor took 47.88ms. Allocated memory is still 148.9MB. Free memory was 96.0MB in the beginning and 93.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:10:28,596 INFO L158 Benchmark]: RCFGBuilder took 445.07ms. Allocated memory is still 148.9MB. Free memory was 93.6MB in the beginning and 74.1MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 01:10:28,596 INFO L158 Benchmark]: TraceAbstraction took 15047.70ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 73.6MB in the beginning and 245.5MB in the end (delta: -171.9MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2023-11-29 01:10:28,597 INFO L158 Benchmark]: Witness Printer took 125.80ms. Allocated memory is still 314.6MB. Free memory was 245.5MB in the beginning and 239.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 01:10:28,599 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.23ms. Allocated memory is still 117.4MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.74ms. Allocated memory is still 148.9MB. Free memory was 110.7MB in the beginning and 98.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.26ms. Allocated memory is still 148.9MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.88ms. Allocated memory is still 148.9MB. Free memory was 96.0MB in the beginning and 93.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.07ms. Allocated memory is still 148.9MB. Free memory was 93.6MB in the beginning and 74.1MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15047.70ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 73.6MB in the beginning and 245.5MB in the end (delta: -171.9MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. * Witness Printer took 125.80ms. Allocated memory is still 314.6MB. Free memory was 245.5MB in the beginning and 239.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 1422 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 925 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 497 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 57 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 145 PreInvPairs, 183 NumberOfFragments, 560 HoareAnnotationTreeSize, 145 FomulaSimplifications, 479 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 275 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 794 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 5960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((var_1_5 == ((var_1_5 / 256) * 256)) && ((16 + var_1_15) == 0)) && (((last_1_var_1_15 / 4294967296) + 1) <= 0)) && (25 == var_1_10)) && (last_1_var_1_10 <= (41 + last_1_var_1_15))) && (0 <= (last_1_var_1_18 / 256))) && (25 <= last_1_var_1_10)) && (var_1_18 == 0)) && (last_1_var_1_18 < 1)) || ((((((((((var_1_1 == var_1_7) && ((((var_1_18 / 256) * 256) + var_1_19) == (var_1_18 + (256 * (var_1_19 / 256))))) && ((((!((var_1_9 == var_1_7)) || (var_1_1 < (var_1_8 + 1))) || ((((((var_1_10 / 4294967296) * 4294967296) + var_1_11) + (4294967295 * var_1_12)) + 1) == (var_1_10 + (4294967296 * (((var_1_11 + (4294967295 * var_1_12)) + 1) / 4294967296))))) && ((((var_1_8 + 1) <= var_1_9) && (var_1_9 == var_1_7)) || ((((((4294967295 * var_1_13) + var_1_11) / 4294967296) * 4294967296) + var_1_10) == ((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11)))) || ((((var_1_13 / 4294967296) * 4294967296) + var_1_12) < ((((var_1_12 / 4294967296) * 4294967296) + var_1_13) + 1)))) && ((256 * (var_1_19 / 256)) <= var_1_18)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || (((var_1_9 < var_1_7) || (((((((var_1_9 / 256) * 256) + 256) + var_1_8) == var_1_9) || (var_1_9 < (((var_1_9 / 256) * 256) + 128))) && (((((var_1_9 / 256) * 256) + 127) < var_1_9) || ((((var_1_9 / 256) * 256) + var_1_8) == var_1_9)))) && (((((127 + ((var_1_7 / 256) * 256)) < var_1_7) || ((var_1_8 + ((var_1_7 / 256) * 256)) == var_1_7)) && ((((256 + var_1_8) + ((var_1_7 / 256) * 256)) == var_1_7) || (var_1_7 < (128 + ((var_1_7 / 256) * 256))))) || (var_1_7 < (var_1_9 + 1)))))) && (((((var_1_12 / 4294967296) * 4294967296) + var_1_13) < (((var_1_13 / 4294967296) * 4294967296) + var_1_12)) || (((((var_1_8 + 1) <= var_1_9) && (var_1_9 == var_1_7)) || ((((((4294967295 * var_1_13) + var_1_11) / 4294967296) * 4294967296) + var_1_10) == ((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11))) && ((!((var_1_9 == var_1_7)) || (var_1_1 < (var_1_8 + 1))) || ((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_11) + 1) == ((4294967296 * ((((4294967295 * var_1_13) + var_1_11) + 1) / 4294967296)) + var_1_10)))))) && (((var_1_8 < 0) || (var_1_8 == var_1_14)) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && ((((var_1_8 + var_1_14) == 0) || (0 < (var_1_8 + 1))) || ((((var_1_12 / 4294967296) * 4294967296) + var_1_8) < (((var_1_8 / 4294967296) * 4294967296) + var_1_12)))) && (2 == var_1_15)) && (var_1_17 == var_1_16))) RESULT: Ultimate proved your program to be correct! [2023-11-29 01:10:28,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06e260fd-2a36-490c-a9d0-bc4d61063379/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 Writing output log to file Ultimate.log Result: TRUE