./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --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_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/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_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/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_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/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 bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:03:28,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:03:29,075 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:03:29,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:03:29,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:03:29,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:03:29,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:03:29,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:03:29,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:03:29,114 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:03:29,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:03:29,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:03:29,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:03:29,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:03:29,117 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:03:29,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:03:29,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:03:29,119 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:03:29,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:03:29,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:03:29,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:03:29,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:03:29,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:03:29,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:03:29,123 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:03:29,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:03:29,124 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:03:29,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:03:29,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:03:29,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:03:29,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:03:29,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:03:29,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:03:29,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:03:29,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:03:29,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:03:29,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:03:29,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:03:29,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:03:29,130 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:03:29,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:03:29,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:03:29,131 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_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/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_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/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 -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2023-11-29 05:03:29,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:03:29,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:03:29,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:03:29,456 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:03:29,457 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:03:29,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-11-29 05:03:32,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:03:32,611 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:03:32,612 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-11-29 05:03:32,618 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/data/88e04e956/2b200e2b427c4ab9877dae7e3bce72f3/FLAG17893d31a [2023-11-29 05:03:32,631 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/data/88e04e956/2b200e2b427c4ab9877dae7e3bce72f3 [2023-11-29 05:03:32,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:03:32,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:03:32,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:03:32,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:03:32,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:03:32,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3873dd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32, skipping insertion in model container [2023-11-29 05:03:32,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,665 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:03:32,802 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_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-11-29 05:03:32,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:03:32,830 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:03:32,841 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_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-11-29 05:03:32,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:03:32,864 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:03:32,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32 WrapperNode [2023-11-29 05:03:32,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:03:32,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:03:32,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:03:32,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:03:32,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,898 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2023-11-29 05:03:32,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:03:32,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:03:32,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:03:32,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:03:32,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,923 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2023-11-29 05:03:32,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:03:32,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:03:32,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:03:32,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:03:32,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (1/1) ... [2023-11-29 05:03:32,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:03:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:03:32,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:03:32,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:03:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:03:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:03:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:03:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:03:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:03:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:03:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:03:33,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:03:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:03:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:03:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:03:33,098 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:03:33,101 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:03:33,231 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:03:33,265 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:03:33,266 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:03:33,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:03:33 BoogieIcfgContainer [2023-11-29 05:03:33,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:03:33,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:03:33,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:03:33,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:03:33,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:03:32" (1/3) ... [2023-11-29 05:03:33,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1ffbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:03:33, skipping insertion in model container [2023-11-29 05:03:33,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:32" (2/3) ... [2023-11-29 05:03:33,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1ffbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:03:33, skipping insertion in model container [2023-11-29 05:03:33,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:03:33" (3/3) ... [2023-11-29 05:03:33,277 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2023-11-29 05:03:33,296 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:03:33,296 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:03:33,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:03:33,352 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;@ac3014b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:03:33,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:03:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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 05:03:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 05:03:33,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:33,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:33,365 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:33,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:33,372 INFO L85 PathProgramCache]: Analyzing trace with hash -137169667, now seen corresponding path program 1 times [2023-11-29 05:03:33,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203962969] [2023-11-29 05:03:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:03:33,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203962969] [2023-11-29 05:03:33,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203962969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:03:33,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:03:33,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:03:33,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840490422] [2023-11-29 05:03:33,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:03:33,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:03:33,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:03:33,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:03:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:03:33,650 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 05:03:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:33,695 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2023-11-29 05:03:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:03:33,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2023-11-29 05:03:33,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:33,706 INFO L225 Difference]: With dead ends: 25 [2023-11-29 05:03:33,706 INFO L226 Difference]: Without dead ends: 14 [2023-11-29 05:03:33,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:03:33,713 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:33,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:03:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-29 05:03:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 9. [2023-11-29 05:03:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 05:03:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-11-29 05:03:33,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2023-11-29 05:03:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:33,746 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-11-29 05:03:33,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 05:03:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-11-29 05:03:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 05:03:33,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:33,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:33,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:03:33,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:33,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1692389551, now seen corresponding path program 1 times [2023-11-29 05:03:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:33,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879041175] [2023-11-29 05:03:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:03:33,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:33,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879041175] [2023-11-29 05:03:33,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879041175] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:33,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086007137] [2023-11-29 05:03:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:33,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:03:33,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:03:33,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:03:33,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:03:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:33,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:03:33,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:03:34,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:03:34,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086007137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:03:34,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:03:34,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-29 05:03:34,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799071683] [2023-11-29 05:03:34,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:03:34,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:03:34,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:03:34,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:03:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:03:34,080 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 05:03:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:34,131 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-11-29 05:03:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:03:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 8 [2023-11-29 05:03:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:34,132 INFO L225 Difference]: With dead ends: 28 [2023-11-29 05:03:34,132 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 05:03:34,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:03:34,135 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:34,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:03:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 05:03:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 12. [2023-11-29 05:03:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 05:03:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-11-29 05:03:34,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2023-11-29 05:03:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:34,142 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-11-29 05:03:34,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 05:03:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-11-29 05:03:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 05:03:34,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:34,143 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:34,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:03:34,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:03:34,344 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:34,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:34,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1107644797, now seen corresponding path program 2 times [2023-11-29 05:03:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:34,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526783995] [2023-11-29 05:03:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:34,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:03:34,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:34,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526783995] [2023-11-29 05:03:34,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526783995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:03:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:03:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:03:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724801344] [2023-11-29 05:03:34,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:03:34,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:03:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:03:34,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:03:34,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:03:34,535 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 05:03:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:34,569 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-11-29 05:03:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:03:34,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 11 [2023-11-29 05:03:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:34,570 INFO L225 Difference]: With dead ends: 17 [2023-11-29 05:03:34,570 INFO L226 Difference]: Without dead ends: 13 [2023-11-29 05:03:34,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:03:34,573 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:34,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:03:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-29 05:03:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-29 05:03:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 05:03:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-11-29 05:03:34,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2023-11-29 05:03:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:34,580 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-11-29 05:03:34,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 05:03:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-11-29 05:03:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 05:03:34,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:34,582 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:34,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:03:34,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:34,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash -21084276, now seen corresponding path program 1 times [2023-11-29 05:03:34,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:34,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913944485] [2023-11-29 05:03:34,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:03:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:34,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913944485] [2023-11-29 05:03:34,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913944485] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:34,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290580327] [2023-11-29 05:03:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:34,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:03:34,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:03:34,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:03:34,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:03:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:34,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:03:34,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:03:34,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:03:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290580327] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:03:34,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:03:34,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-29 05:03:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674464653] [2023-11-29 05:03:34,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:03:34,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:03:34,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:03:34,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:03:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:03:34,952 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 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 05:03:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:34,996 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2023-11-29 05:03:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:03:34,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 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) Word has length 12 [2023-11-29 05:03:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:34,998 INFO L225 Difference]: With dead ends: 31 [2023-11-29 05:03:34,998 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 05:03:34,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:03:35,001 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:35,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:03:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 05:03:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2023-11-29 05:03:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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 05:03:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-11-29 05:03:35,009 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2023-11-29 05:03:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:35,009 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-11-29 05:03:35,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 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 05:03:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-11-29 05:03:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 05:03:35,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:35,010 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:35,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:03:35,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:03:35,218 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:35,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:35,218 INFO L85 PathProgramCache]: Analyzing trace with hash 89607372, now seen corresponding path program 2 times [2023-11-29 05:03:35,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:35,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094556905] [2023-11-29 05:03:35,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:35,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:03:35,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:35,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094556905] [2023-11-29 05:03:35,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094556905] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649494161] [2023-11-29 05:03:35,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:03:35,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:03:35,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:03:35,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:03:35,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:03:35,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:03:35,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:03:35,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:03:35,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:03:35,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:03:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649494161] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:03:35,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:03:35,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2023-11-29 05:03:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436975049] [2023-11-29 05:03:35,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:03:35,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:03:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:03:35,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:03:35,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:03:35,791 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 05:03:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:35,837 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-11-29 05:03:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:03:35,838 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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) Word has length 18 [2023-11-29 05:03:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:35,839 INFO L225 Difference]: With dead ends: 32 [2023-11-29 05:03:35,839 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 05:03:35,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:03:35,841 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:35,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:03:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 05:03:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2023-11-29 05:03:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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 05:03:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-11-29 05:03:35,848 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2023-11-29 05:03:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:35,849 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-11-29 05:03:35,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 05:03:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-11-29 05:03:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:03:35,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:35,850 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:35,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:03:36,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:03:36,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:36,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1966567974, now seen corresponding path program 3 times [2023-11-29 05:03:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:36,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565621255] [2023-11-29 05:03:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:36,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 05:03:36,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:36,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565621255] [2023-11-29 05:03:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565621255] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:36,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333163632] [2023-11-29 05:03:36,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:03:36,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:03:36,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:03:36,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:03:36,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:03:36,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 05:03:36,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:03:36,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 05:03:36,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 05:03:36,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 05:03:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333163632] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:03:36,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:03:36,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-11-29 05:03:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533414898] [2023-11-29 05:03:36,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:03:36,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:03:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:03:36,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:03:36,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:03:36,704 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 05:03:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:37,738 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-11-29 05:03:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:03:37,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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) Word has length 19 [2023-11-29 05:03:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:37,740 INFO L225 Difference]: With dead ends: 28 [2023-11-29 05:03:37,740 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 05:03:37,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:03:37,741 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:37,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:03:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 05:03:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-29 05:03:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 05:03:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-11-29 05:03:37,752 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2023-11-29 05:03:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:37,752 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-11-29 05:03:37,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 05:03:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-11-29 05:03:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 05:03:37,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:37,753 INFO L195 NwaCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:37,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:03:37,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 05:03:37,954 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:37,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash -32920454, now seen corresponding path program 4 times [2023-11-29 05:03:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:37,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141670103] [2023-11-29 05:03:37,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 05:03:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141670103] [2023-11-29 05:03:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141670103] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:38,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496227694] [2023-11-29 05:03:38,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:03:38,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:03:38,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:03:38,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:03:38,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bbf7f7a-c82a-486d-9e8e-bb0c1e717399/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:03:39,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:03:39,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:03:39,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 05:03:39,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:52,671 WARN L293 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 12 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:04:36,151 WARN L293 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:04:54,282 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 12 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:06:41,539 WARN L293 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 131 DAG size of output: 126 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:06:56,781 WARN L293 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:07:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:07:03,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:47,881 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:08:35,033 WARN L293 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:08:41,237 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:09:34,149 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:09:59,591 WARN L293 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:10:23,110 WARN L293 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:10:59,675 WARN L293 SmtUtils]: Spent 7.85s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:11:23,300 WARN L293 SmtUtils]: Spent 7.73s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:11:31,204 WARN L293 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:11:36,982 WARN L293 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:12:53,014 WARN L293 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:13:11,498 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:13:57,569 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:05,595 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:13,614 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:21,641 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:47,183 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:56,050 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse50 (mod (+ 1073741692 (* |c_ULTIMATE.start_main_~i~0#1| 25)) 1073741824))) (let ((.cse6 (* .cse50 2)) (.cse7 (* .cse50 4)) (.cse10 (* 2 (mod (+ 2147483624 (* 5 |c_ULTIMATE.start_main_~i~0#1|)) 2147483648)))) (and (forall ((v_z_135 Int) (v_y_135 Int) (v_z_87 Int) (v_y_97 Int) (v_y_87 Int) (v_y_132 Int)) (let ((.cse8 (* v_y_135 2147483648)) (.cse9 (* 1288490189 v_z_135))) (let ((.cse5 (+ .cse8 .cse10 .cse9)) (.cse4 (+ .cse8 (* v_y_132 4294967296) .cse9)) (.cse3 (+ (* 2 v_z_135) .cse7)) (.cse0 (* v_y_87 2147483648)) (.cse1 (* 1288490189 v_z_87)) (.cse2 (* v_y_97 4294967296))) (or (< (+ .cse0 .cse1 .cse2 4294967248) .cse3) (< v_z_87 1073741820) (< 57 .cse4) (< 2147483647 v_z_87) (< 4294967295 .cse5) (< 2147483647 (+ .cse6 v_z_135)) (< (+ .cse0 .cse1 2147483648) 0) (< .cse3 (+ .cse0 .cse1 1)) (< .cse5 2147483648) (< .cse4 48) (< .cse3 (+ .cse0 .cse1 .cse2 4294967239)))))) (forall ((v_y_162 Int) (v_z_164 Int) (v_y_164 Int)) (let ((.cse11 (* 1288490189 v_z_164)) (.cse12 (* v_y_164 2147483648))) (let ((.cse17 (+ .cse11 (* v_y_162 4294967296) .cse12))) (or (< 2147483647 (+ .cse6 v_z_164)) (< 2147483647 (+ .cse10 .cse11 .cse12)) (< (+ .cse11 .cse12) 0) (forall ((v_z_87 Int) (v_y_97 Int) (v_y_87 Int)) (let ((.cse15 (+ .cse7 (* 2 v_z_164))) (.cse13 (* v_y_87 2147483648)) (.cse14 (* 1288490189 v_z_87)) (.cse16 (* v_y_97 4294967296))) (or (< v_z_87 1073741820) (< 2147483647 v_z_87) (< (+ .cse13 .cse14 2147483648) 0) (< .cse15 (+ .cse13 .cse14 1)) (< (+ .cse13 .cse14 .cse16 4294967248) .cse15) (< .cse15 (+ .cse13 .cse14 .cse16 4294967239))))) (< .cse17 48) (< 57 .cse17) (< v_z_164 0))))) (forall ((v_z_87 Int)) (or (< v_z_87 1073741820) (forall ((v_y_87 Int)) (let ((.cse24 (* v_y_87 2147483648)) (.cse25 (* 1288490189 v_z_87))) (let ((.cse18 (+ .cse24 .cse25))) (or (< 2147483647 .cse18) (forall ((v_z_152 Int) (v_y_103 Int)) (let ((.cse20 (+ .cse24 (* v_y_103 4294967296) .cse25)) (.cse19 (* 2 v_z_152))) (or (< v_z_152 0) (< .cse18 (+ .cse19 .cse7)) (< (+ .cse19 57 .cse7) .cse20) (< .cse20 (+ .cse19 48 .cse7)) (forall ((v_y_152 Int) (v_y_149 Int)) (let ((.cse21 (* v_y_152 2147483648)) (.cse22 (* 1288490189 v_z_152))) (let ((.cse23 (+ (* v_y_149 4294967296) .cse21 .cse22))) (or (< (+ .cse21 .cse22) 0) (< 2147483647 (+ .cse10 .cse21 .cse22)) (< .cse23 48) (< 57 .cse23)))))))))))) (< 2147483647 v_z_87))) (forall ((v_z_123 Int) (v_y_103 Int) (v_z_87 Int) (v_y_123 Int) (v_y_87 Int) (v_y_121 Int)) (let ((.cse31 (* 1288490189 v_z_123)) (.cse32 (* v_y_123 2147483648)) (.cse33 (* v_y_87 2147483648)) (.cse34 (* 1288490189 v_z_87))) (let ((.cse29 (+ .cse33 (* v_y_103 4294967296) .cse34)) (.cse27 (* 2 v_z_123)) (.cse26 (+ .cse33 .cse34)) (.cse28 (+ .cse31 (* v_y_121 4294967296) .cse32)) (.cse30 (+ .cse31 .cse10 .cse32))) (or (< .cse26 (+ .cse7 .cse27)) (< v_z_87 1073741820) (< .cse28 48) (< 2147483647 v_z_87) (< (+ 57 .cse7 .cse27) .cse29) (< .cse29 (+ 48 .cse7 .cse27)) (< 2147483647 .cse26) (< .cse30 2147483648) (< 57 .cse28) (< 4294967295 .cse30) (< v_z_123 0))))) (forall ((v_z_87 Int)) (or (< v_z_87 1073741820) (< 2147483647 v_z_87) (forall ((v_y_87 Int)) (let ((.cse41 (* v_y_87 2147483648)) (.cse42 (* 1288490189 v_z_87))) (let ((.cse35 (+ .cse41 .cse42))) (or (< 2147483647 .cse35) (forall ((v_z_152 Int) (v_y_103 Int)) (let ((.cse40 (+ .cse41 (* v_y_103 4294967296) .cse42)) (.cse36 (* 2 v_z_152))) (or (< v_z_152 0) (< .cse35 (+ .cse36 .cse7)) (forall ((v_y_152 Int) (v_y_149 Int)) (let ((.cse38 (* v_y_152 2147483648)) (.cse39 (* 1288490189 v_z_152))) (let ((.cse37 (+ (* v_y_149 4294967296) .cse38 .cse39))) (or (< .cse37 48) (< 4294967295 (+ .cse38 .cse39)) (< 57 .cse37) (< (+ .cse10 .cse38 .cse39) 4294967296))))) (< (+ .cse36 57 .cse7) .cse40) (< .cse40 (+ .cse36 48 .cse7))))))))))) (forall ((v_y_162 Int) (v_z_164 Int) (v_y_164 Int)) (let ((.cse43 (* 1288490189 v_z_164)) (.cse44 (* v_y_164 2147483648))) (let ((.cse49 (+ .cse43 (* v_y_162 4294967296) .cse44))) (or (< 2147483647 (+ .cse6 v_z_164)) (< 4294967295 (+ .cse43 .cse44)) (forall ((v_z_87 Int) (v_y_97 Int) (v_y_87 Int)) (let ((.cse47 (+ .cse7 (* 2 v_z_164))) (.cse45 (* v_y_87 2147483648)) (.cse46 (* 1288490189 v_z_87)) (.cse48 (* v_y_97 4294967296))) (or (< v_z_87 1073741820) (< 2147483647 v_z_87) (< (+ .cse45 .cse46 2147483648) 0) (< .cse47 (+ .cse45 .cse46 1)) (< (+ .cse45 .cse46 .cse48 4294967248) .cse47) (< .cse47 (+ .cse45 .cse46 .cse48 4294967239))))) (< .cse49 48) (< 57 .cse49) (< v_z_164 0) (< (+ .cse10 .cse43 .cse44) 4294967296)))))))) is different from false [2023-11-29 05:15:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 3 not checked. [2023-11-29 05:15:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496227694] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:15:13,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:15:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-29 05:15:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102032923] [2023-11-29 05:15:13,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:15:13,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:15:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:13,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:15:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=106, Unknown=9, NotChecked=22, Total=182 [2023-11-29 05:15:13,760 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 05:15:17,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:15:22,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:13,951 WARN L293 SmtUtils]: Spent 43.43s on a formula simplification. DAG size of input: 60 DAG size of output: 15 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:16:17,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:16:21,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:25,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:38,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:16:42,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:46,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:50,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:16:54,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:16:58,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:17:02,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse50 (mod (+ 1073741692 (* |c_ULTIMATE.start_main_~i~0#1| 25)) 1073741824))) (let ((.cse6 (* .cse50 2)) (.cse7 (* .cse50 4)) (.cse10 (* 2 (mod (+ 2147483624 (* 5 |c_ULTIMATE.start_main_~i~0#1|)) 2147483648)))) (and (forall ((v_z_135 Int) (v_y_135 Int) (v_z_87 Int) (v_y_97 Int) (v_y_87 Int) (v_y_132 Int)) (let ((.cse8 (* v_y_135 2147483648)) (.cse9 (* 1288490189 v_z_135))) (let ((.cse5 (+ .cse8 .cse10 .cse9)) (.cse4 (+ .cse8 (* v_y_132 4294967296) .cse9)) (.cse3 (+ (* 2 v_z_135) .cse7)) (.cse0 (* v_y_87 2147483648)) (.cse1 (* 1288490189 v_z_87)) (.cse2 (* v_y_97 4294967296))) (or (< (+ .cse0 .cse1 .cse2 4294967248) .cse3) (< v_z_87 1073741820) (< 57 .cse4) (< 2147483647 v_z_87) (< 4294967295 .cse5) (< 2147483647 (+ .cse6 v_z_135)) (< (+ .cse0 .cse1 2147483648) 0) (< .cse3 (+ .cse0 .cse1 1)) (< .cse5 2147483648) (< .cse4 48) (< .cse3 (+ .cse0 .cse1 .cse2 4294967239)))))) (forall ((v_y_162 Int) (v_z_164 Int) (v_y_164 Int)) (let ((.cse11 (* 1288490189 v_z_164)) (.cse12 (* v_y_164 2147483648))) (let ((.cse17 (+ .cse11 (* v_y_162 4294967296) .cse12))) (or (< 2147483647 (+ .cse6 v_z_164)) (< 2147483647 (+ .cse10 .cse11 .cse12)) (< (+ .cse11 .cse12) 0) (forall ((v_z_87 Int) (v_y_97 Int) (v_y_87 Int)) (let ((.cse15 (+ .cse7 (* 2 v_z_164))) (.cse13 (* v_y_87 2147483648)) (.cse14 (* 1288490189 v_z_87)) (.cse16 (* v_y_97 4294967296))) (or (< v_z_87 1073741820) (< 2147483647 v_z_87) (< (+ .cse13 .cse14 2147483648) 0) (< .cse15 (+ .cse13 .cse14 1)) (< (+ .cse13 .cse14 .cse16 4294967248) .cse15) (< .cse15 (+ .cse13 .cse14 .cse16 4294967239))))) (< .cse17 48) (< 57 .cse17) (< v_z_164 0))))) (forall ((v_z_87 Int)) (or (< v_z_87 1073741820) (forall ((v_y_87 Int)) (let ((.cse24 (* v_y_87 2147483648)) (.cse25 (* 1288490189 v_z_87))) (let ((.cse18 (+ .cse24 .cse25))) (or (< 2147483647 .cse18) (forall ((v_z_152 Int) (v_y_103 Int)) (let ((.cse20 (+ .cse24 (* v_y_103 4294967296) .cse25)) (.cse19 (* 2 v_z_152))) (or (< v_z_152 0) (< .cse18 (+ .cse19 .cse7)) (< (+ .cse19 57 .cse7) .cse20) (< .cse20 (+ .cse19 48 .cse7)) (forall ((v_y_152 Int) (v_y_149 Int)) (let ((.cse21 (* v_y_152 2147483648)) (.cse22 (* 1288490189 v_z_152))) (let ((.cse23 (+ (* v_y_149 4294967296) .cse21 .cse22))) (or (< (+ .cse21 .cse22) 0) (< 2147483647 (+ .cse10 .cse21 .cse22)) (< .cse23 48) (< 57 .cse23)))))))))))) (< 2147483647 v_z_87))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_z_123 Int) (v_y_103 Int) (v_z_87 Int) (v_y_123 Int) (v_y_87 Int) (v_y_121 Int)) (let ((.cse31 (* 1288490189 v_z_123)) (.cse32 (* v_y_123 2147483648)) (.cse33 (* v_y_87 2147483648)) (.cse34 (* 1288490189 v_z_87))) (let ((.cse29 (+ .cse33 (* v_y_103 4294967296) .cse34)) (.cse27 (* 2 v_z_123)) (.cse26 (+ .cse33 .cse34)) (.cse28 (+ .cse31 (* v_y_121 4294967296) .cse32)) (.cse30 (+ .cse31 .cse10 .cse32))) (or (< .cse26 (+ .cse7 .cse27)) (< v_z_87 1073741820) (< .cse28 48) (< 2147483647 v_z_87) (< (+ 57 .cse7 .cse27) .cse29) (< .cse29 (+ 48 .cse7 .cse27)) (< 2147483647 .cse26) (< .cse30 2147483648) (< 57 .cse28) (< 4294967295 .cse30) (< v_z_123 0))))) (forall ((v_z_87 Int)) (or (< v_z_87 1073741820) (< 2147483647 v_z_87) (forall ((v_y_87 Int)) (let ((.cse41 (* v_y_87 2147483648)) (.cse42 (* 1288490189 v_z_87))) (let ((.cse35 (+ .cse41 .cse42))) (or (< 2147483647 .cse35) (forall ((v_z_152 Int) (v_y_103 Int)) (let ((.cse40 (+ .cse41 (* v_y_103 4294967296) .cse42)) (.cse36 (* 2 v_z_152))) (or (< v_z_152 0) (< .cse35 (+ .cse36 .cse7)) (forall ((v_y_152 Int) (v_y_149 Int)) (let ((.cse38 (* v_y_152 2147483648)) (.cse39 (* 1288490189 v_z_152))) (let ((.cse37 (+ (* v_y_149 4294967296) .cse38 .cse39))) (or (< .cse37 48) (< 4294967295 (+ .cse38 .cse39)) (< 57 .cse37) (< (+ .cse10 .cse38 .cse39) 4294967296))))) (< (+ .cse36 57 .cse7) .cse40) (< .cse40 (+ .cse36 48 .cse7))))))))))) (forall ((v_y_162 Int) (v_z_164 Int) (v_y_164 Int)) (let ((.cse43 (* 1288490189 v_z_164)) (.cse44 (* v_y_164 2147483648))) (let ((.cse49 (+ .cse43 (* v_y_162 4294967296) .cse44))) (or (< 2147483647 (+ .cse6 v_z_164)) (< 4294967295 (+ .cse43 .cse44)) (forall ((v_z_87 Int) (v_y_97 Int) (v_y_87 Int)) (let ((.cse47 (+ .cse7 (* 2 v_z_164))) (.cse45 (* v_y_87 2147483648)) (.cse46 (* 1288490189 v_z_87)) (.cse48 (* v_y_97 4294967296))) (or (< v_z_87 1073741820) (< 2147483647 v_z_87) (< (+ .cse45 .cse46 2147483648) 0) (< .cse47 (+ .cse45 .cse46 1)) (< (+ .cse45 .cse46 .cse48 4294967248) .cse47) (< .cse47 (+ .cse45 .cse46 .cse48 4294967239))))) (< .cse49 48) (< 57 .cse49) (< v_z_164 0) (< (+ .cse10 .cse43 .cse44) 4294967296)))))))) is different from false [2023-11-29 05:17:44,140 WARN L293 SmtUtils]: Spent 33.45s on a formula simplification. DAG size of input: 177 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:17:48,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 05:18:44,269 WARN L293 SmtUtils]: Spent 51.16s on a formula simplification. DAG size of input: 146 DAG size of output: 127 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:18:48,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]