./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/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_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/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_c4440c67-948d-4cb1-8c24-3ad264f29671/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 b64fc249111ce1622477a41c2b596a03a08ef102af2aafa943ca2a90b99192a7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:44:27,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:44:27,520 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:44:27,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:44:27,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:44:27,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:44:27,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:44:27,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:44:27,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:44:27,555 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:44:27,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:44:27,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:44:27,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:44:27,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:44:27,558 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:44:27,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:44:27,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:44:27,560 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:44:27,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:44:27,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:44:27,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:44:27,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:44:27,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:44:27,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:44:27,567 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:44:27,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:44:27,568 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:44:27,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:44:27,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:44:27,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:44:27,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:44:27,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:44:27,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:44:27,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:44:27,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:44:27,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:44:27,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:44:27,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:44:27,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:44:27,572 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:44:27,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:44:27,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:44:27,573 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_c4440c67-948d-4cb1-8c24-3ad264f29671/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_c4440c67-948d-4cb1-8c24-3ad264f29671/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 -> b64fc249111ce1622477a41c2b596a03a08ef102af2aafa943ca2a90b99192a7 [2023-11-29 01:44:27,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:44:27,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:44:27,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:44:27,872 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:44:27,873 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:44:27,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-10.i [2023-11-29 01:44:30,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:44:31,158 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:44:31,158 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-10.i [2023-11-29 01:44:31,172 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/data/1014c530a/ed1381be35cc418f85ce96051659006d/FLAG287c0cf12 [2023-11-29 01:44:31,189 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/data/1014c530a/ed1381be35cc418f85ce96051659006d [2023-11-29 01:44:31,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:44:31,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:44:31,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:44:31,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:44:31,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:44:31,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2783f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31, skipping insertion in model container [2023-11-29 01:44:31,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,250 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:44:31,411 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_c4440c67-948d-4cb1-8c24-3ad264f29671/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-10.i[915,928] [2023-11-29 01:44:31,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:44:31,516 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:44:31,531 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_c4440c67-948d-4cb1-8c24-3ad264f29671/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-10.i[915,928] [2023-11-29 01:44:31,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:44:31,605 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:44:31,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31 WrapperNode [2023-11-29 01:44:31,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:44:31,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:44:31,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:44:31,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:44:31,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,694 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 333 [2023-11-29 01:44:31,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:44:31,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:44:31,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:44:31,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:44:31,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,743 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 01:44:31,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:44:31,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:44:31,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:44:31,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:44:31,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (1/1) ... [2023-11-29 01:44:31,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:44:31,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:44:31,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:44:31,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:44:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:44:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:44:31,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:44:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:44:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:44:31,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:44:32,004 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:44:32,007 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:44:32,625 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:44:32,665 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:44:32,666 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:44:32,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:44:32 BoogieIcfgContainer [2023-11-29 01:44:32,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:44:32,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:44:32,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:44:32,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:44:32,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:44:31" (1/3) ... [2023-11-29 01:44:32,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e821196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:44:32, skipping insertion in model container [2023-11-29 01:44:32,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:44:31" (2/3) ... [2023-11-29 01:44:32,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e821196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:44:32, skipping insertion in model container [2023-11-29 01:44:32,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:44:32" (3/3) ... [2023-11-29 01:44:32,678 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-10.i [2023-11-29 01:44:32,703 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:44:32,703 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:44:32,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:44:32,775 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;@63227f30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:44:32,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:44:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 84 states have internal predecessors, (123), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 01:44:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2023-11-29 01:44:32,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:44:32,812 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:44:32,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:44:32,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1217600265, now seen corresponding path program 1 times [2023-11-29 01:44:32,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353166197] [2023-11-29 01:44:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:33,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:33,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353166197] [2023-11-29 01:44:33,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-29 01:44:33,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636537628] [2023-11-29 01:44:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:33,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:44:33,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:44:33,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:44:33,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:44:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:33,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:44:33,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:44:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2023-11-29 01:44:33,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:44:33,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636537628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:33,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:44:33,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397959594] [2023-11-29 01:44:33,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:33,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:44:33,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:44:33,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:44:33,553 INFO L87 Difference]: Start difference. First operand has 134 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 84 states have internal predecessors, (123), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-11-29 01:44:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:44:33,605 INFO L93 Difference]: Finished difference Result 265 states and 484 transitions. [2023-11-29 01:44:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:44:33,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 292 [2023-11-29 01:44:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:44:33,618 INFO L225 Difference]: With dead ends: 265 [2023-11-29 01:44:33,618 INFO L226 Difference]: Without dead ends: 132 [2023-11-29 01:44:33,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:44:33,627 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:44:33,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:44:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-29 01:44:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-11-29 01:44:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 01:44:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 214 transitions. [2023-11-29 01:44:33,700 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 214 transitions. Word has length 292 [2023-11-29 01:44:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:44:33,701 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 214 transitions. [2023-11-29 01:44:33,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-11-29 01:44:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 214 transitions. [2023-11-29 01:44:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2023-11-29 01:44:33,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:44:33,711 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:44:33,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:44:33,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-29 01:44:33,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:44:33,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1656513263, now seen corresponding path program 1 times [2023-11-29 01:44:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:33,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123029890] [2023-11-29 01:44:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:33,998 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:44:33,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949376182] [2023-11-29 01:44:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:33,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:44:33,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:44:34,001 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:44:34,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:44:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:34,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:44:34,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:44:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-11-29 01:44:34,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:44:34,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123029890] [2023-11-29 01:44:34,864 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:44:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949376182] [2023-11-29 01:44:34,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949376182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:34,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:34,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:44:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599566356] [2023-11-29 01:44:34,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:34,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:44:34,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:34,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:44:34,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:44:34,869 INFO L87 Difference]: Start difference. First operand 132 states and 214 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-29 01:44:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:44:35,224 INFO L93 Difference]: Finished difference Result 395 states and 641 transitions. [2023-11-29 01:44:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:44:35,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2023-11-29 01:44:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:44:35,233 INFO L225 Difference]: With dead ends: 395 [2023-11-29 01:44:35,233 INFO L226 Difference]: Without dead ends: 264 [2023-11-29 01:44:35,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:44:35,237 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 183 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:44:35,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 826 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:44:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-29 01:44:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 235. [2023-11-29 01:44:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 136 states have internal predecessors, (191), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 01:44:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 383 transitions. [2023-11-29 01:44:35,304 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 383 transitions. Word has length 292 [2023-11-29 01:44:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:44:35,306 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 383 transitions. [2023-11-29 01:44:35,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-29 01:44:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 383 transitions. [2023-11-29 01:44:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-11-29 01:44:35,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:44:35,314 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:44:35,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:44:35,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-29 01:44:35,515 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:44:35,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2047185223, now seen corresponding path program 1 times [2023-11-29 01:44:35,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:35,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463642383] [2023-11-29 01:44:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:35,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:35,574 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:44:35,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558713202] [2023-11-29 01:44:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:35,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:44:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:44:35,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:44:35,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:44:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:35,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 01:44:36,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:44:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1997 proven. 96 refuted. 0 times theorem prover too weak. 2419 trivial. 0 not checked. [2023-11-29 01:44:43,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:46:59,149 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse2 (mod c_~var_1_1~0 65536)) (.cse1 (mod c_~var_1_5~0 65536))) (and (or (not .cse0) (< 65534 .cse1) (< c_~var_1_13~0 0) (= .cse2 .cse1)) (or .cse0 (let ((.cse108 (* 65535 c_~var_1_5~0))) (let ((.cse10 (mod .cse108 65536)) (.cse11 (* (div (* (- 1) .cse1) 65536) 65536))) (let ((.cse101 (+ c_~var_1_13~0 .cse10 .cse1 .cse11)) (.cse5 (+ .cse2 65536)) (.cse7 (mod (+ .cse108 56892) 65536))) (let ((.cse9 (* (div (+ (- 1) .cse10) 65536) 65536)) (.cse41 (forall ((v_y_140 Int) (v_z_85 Int) (v_y_85 Int) (v_z_140 Int)) (let ((.cse105 (+ .cse7 v_z_140)) (.cse106 (+ (* 65536 v_y_140) (* v_z_140 65535))) (.cse107 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< .cse2 (+ v_z_85 1)) (= .cse105 .cse5) (= .cse2 .cse105) (< v_z_85 0) (< 65535 .cse106) (< .cse106 .cse107) (< 65535 v_z_140) (< v_z_140 0) (< .cse107 0))))) (.cse50 (+ .cse2 2)) (.cse64 (< .cse10 1)) (.cse12 (+ .cse2 65537)) (.cse21 (< 65534 .cse2)) (.cse23 (< .cse101 65536)) (.cse20 (+ .cse2 1)) (.cse26 (< .cse2 1)) (.cse22 (forall ((v_z_143 Int) (v_z_85 Int) (v_y_85 Int) (v_y_143 Int)) (let ((.cse103 (+ .cse7 v_z_143)) (.cse102 (+ (* v_z_143 65535) (* 65536 v_y_143))) (.cse104 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< .cse2 (+ v_z_85 1)) (< 65535 .cse102) (< v_z_85 0) (< 65535 .cse103) (= .cse2 .cse103) (< v_z_143 0) (< .cse102 .cse104) (< .cse104 0))))) (.cse15 (+ .cse2 65538)) (.cse8 (< .cse101 0))) (and (or (forall ((v_z_143 Int) (v_z_85 Int) (v_y_85 Int) (v_y_143 Int)) (let ((.cse4 (+ .cse7 v_z_143)) (.cse3 (+ (* v_z_143 65535) (* 65536 v_y_143))) (.cse6 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< .cse2 (+ v_z_85 1)) (< 65535 .cse3) (< v_z_85 0) (= .cse2 .cse4) (< v_z_143 0) (= .cse5 .cse4) (< 65535 v_z_143) (< .cse3 .cse6) (< .cse6 0)))) .cse8) (or (forall ((v_z_146 Int) (v_z_85 Int) (v_y_146 Int) (v_y_85 Int)) (let ((.cse13 (+ (* v_z_146 65535) (* 65536 v_y_146))) (.cse14 (+ .cse7 v_z_146)) (.cse16 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< (+ .cse9 v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse12) (< 65535 .cse13) (< 65535 v_z_146) (= .cse2 .cse14) (< (+ v_z_85 .cse10) .cse15) (< .cse13 .cse16) (= .cse5 .cse14) (< v_z_146 0) (< .cse16 0) (< 65535 v_z_85)))) .cse8) (or (forall ((v_z_143 Int) (v_z_85 Int) (v_y_85 Int) (v_y_143 Int)) (let ((.cse18 (+ .cse7 v_z_143)) (.cse17 (+ (* v_z_143 65535) (* 65536 v_y_143))) (.cse19 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< 65535 .cse17) (< v_z_85 0) (= .cse2 .cse18) (< v_z_143 0) (= .cse5 .cse18) (< 65535 v_z_143) (< .cse17 .cse19) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse20) (< .cse19 0) (< 65535 v_z_85)))) .cse21 .cse8) (<= (+ c_~var_1_13~0 .cse1 .cse11 1) 0) (or .cse22 .cse23) (or (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse25 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse24 (+ v_z_82 .cse7))) (or (= .cse5 .cse24) (< 65535 .cse25) (< .cse25 1) (< .cse24 65536) (< 65535 v_z_82)))) .cse8) (or .cse26 (forall ((v_z_146 Int) (v_z_85 Int) (v_y_146 Int) (v_y_85 Int)) (let ((.cse28 (+ (* v_z_146 65535) (* 65536 v_y_146))) (.cse27 (+ .cse7 v_z_146)) (.cse29 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< .cse27 65536) (< 65535 .cse28) (< 65535 v_z_146) (< .cse28 .cse29) (= .cse5 .cse27) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) 65536) (< .cse29 0) (< 65535 v_z_85))))) (forall ((v_z_146 Int)) (let ((.cse30 (+ .cse7 v_z_146))) (or (< 65535 .cse30) (= .cse2 .cse30) (< v_z_146 0) (forall ((v_y_146 Int)) (let ((.cse31 (+ (* v_z_146 65535) (* 65536 v_y_146)))) (or (< 65535 .cse31) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse32 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< (+ .cse9 v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse12) (< (+ v_z_85 .cse10) .cse15) (< .cse31 .cse32) (< .cse32 0) (< 65535 v_z_85)))))))))) (or .cse26 (forall ((v_z_146 Int) (v_z_85 Int) (v_y_146 Int) (v_y_85 Int)) (let ((.cse33 (+ (* v_z_146 65535) (* 65536 v_y_146))) (.cse34 (+ .cse7 v_z_146)) (.cse35 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< 65535 .cse33) (< (+ v_z_85 .cse10) 65537) (< 65535 v_z_146) (= .cse2 .cse34) (< .cse33 .cse35) (= .cse5 .cse34) (< v_z_146 0) (< (+ .cse9 v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) 65536) (< .cse35 0) (< 65535 v_z_85)))) .cse8) (forall ((v_z_146 Int)) (let ((.cse38 (+ .cse7 v_z_146))) (or (forall ((v_y_146 Int)) (let ((.cse36 (+ (* v_z_146 65535) (* 65536 v_y_146)))) (or (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse37 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse12) (< .cse36 .cse37) (< .cse37 0) (< 65535 v_z_85)))) (< 65535 .cse36)))) (< .cse38 65536) (< 65535 v_z_146) (= .cse5 .cse38)))) (<= (+ c_~var_1_13~0 1) 0) (or (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse39 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse40 (+ v_z_82 .cse7))) (or (< 65535 .cse39) (< .cse39 1) (= .cse2 .cse40) (< 65535 .cse40) (< v_z_82 0)))) .cse8) (or .cse41 .cse23) (or .cse26 (forall ((v_z_146 Int) (v_z_85 Int) (v_y_146 Int) (v_y_85 Int)) (let ((.cse43 (+ .cse7 v_z_146)) (.cse42 (+ (* v_z_146 65535) (* 65536 v_y_146))) (.cse44 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< 65535 .cse42) (< (+ v_z_85 .cse10) 65537) (< 65535 .cse43) (= .cse2 .cse43) (< .cse42 .cse44) (< v_z_146 0) (< (+ .cse9 v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) 65536) (< .cse44 0) (< 65535 v_z_85)))) .cse8) (or .cse26 (forall ((v_z_146 Int) (v_z_85 Int) (v_y_146 Int) (v_y_85 Int)) (let ((.cse46 (+ .cse7 v_z_146)) (.cse45 (+ (* v_z_146 65535) (* 65536 v_y_146))) (.cse47 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< 65535 .cse45) (< (+ v_z_85 .cse10) 65537) (< 65535 .cse46) (= .cse2 .cse46) (< .cse45 .cse47) (< v_z_146 0) (< .cse47 0) (< 65535 v_z_85) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) 131072))))) (forall ((v_z_146 Int)) (let ((.cse51 (+ .cse7 v_z_146))) (or (forall ((v_y_146 Int)) (let ((.cse48 (+ (* v_z_146 65535) (* 65536 v_y_146)))) (or (< 65535 .cse48) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse49 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse12) (< .cse48 .cse49) (< .cse49 0) (< 65535 v_z_85) (< v_z_85 .cse50))))))) (< 65535 v_z_146) (= .cse2 .cse51) (= .cse5 .cse51) (< v_z_146 0)))) (or .cse41 .cse8) (forall ((v_z_146 Int)) (let ((.cse54 (+ .cse7 v_z_146))) (or (forall ((v_y_146 Int)) (let ((.cse52 (+ (* v_z_146 65535) (* 65536 v_y_146)))) (or (< 65535 .cse52) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse53 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse12) (< .cse52 .cse53) (< .cse53 0) (< 65535 v_z_85) (< v_z_85 .cse50))))))) (< 65535 .cse54) (= .cse2 .cse54) (< v_z_146 0)))) (or (forall ((v_y_140 Int) (v_z_85 Int) (v_y_85 Int) (v_z_140 Int)) (let ((.cse55 (+ .cse7 v_z_140)) (.cse56 (+ (* 65536 v_y_140) (* v_z_140 65535))) (.cse57 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< .cse2 (+ v_z_85 1)) (= .cse55 .cse5) (< .cse55 65536) (< v_z_85 0) (< 65535 .cse56) (< .cse56 .cse57) (< 65535 v_z_140) (< .cse57 0)))) .cse8) (or (forall ((v_z_143 Int) (v_z_85 Int) (v_y_85 Int) (v_y_143 Int)) (let ((.cse58 (+ (* v_z_143 65535) (* 65536 v_y_143))) (.cse60 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse59 (+ .cse7 v_z_143))) (or (< 65535 .cse58) (< v_z_85 0) (= .cse5 .cse59) (< 65535 v_z_143) (< .cse58 .cse60) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse20) (< .cse60 0) (< 65535 v_z_85) (< .cse59 65536)))) .cse21 .cse8) (or (forall ((v_y_140 Int) (v_z_85 Int) (v_y_85 Int) (v_z_140 Int)) (let ((.cse61 (+ .cse7 v_z_140)) (.cse62 (+ (* 65536 v_y_140) (* v_z_140 65535))) (.cse63 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (= .cse61 .cse5) (= .cse2 .cse61) (< v_z_85 0) (< 65535 .cse62) (< .cse62 .cse63) (< 65535 v_z_140) (< v_z_140 0) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse20) (< .cse63 0) (< 65535 v_z_85)))) .cse8) (or .cse64 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse66 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse65 (+ v_z_82 .cse7))) (or (= .cse5 .cse65) (< 65535 .cse66) (< .cse66 1) (< 65535 v_z_82) (= .cse2 .cse65) (< v_z_82 0)))) .cse8) (forall ((v_z_140 Int)) (let ((.cse67 (+ .cse7 v_z_140))) (or (= .cse2 .cse67) (forall ((v_y_140 Int)) (let ((.cse68 (+ (* 65536 v_y_140) (* v_z_140 65535)))) (or (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse69 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse12) (< .cse68 .cse69) (< .cse69 0) (< 65535 v_z_85)))) (< 65535 .cse68)))) (< v_z_140 0) (< 65535 .cse67)))) (let ((.cse70 (div (* (- 1) .cse10) 65536))) (or (< 0 (+ .cse70 1)) .cse21 .cse8 (forall ((v_z_143 Int) (v_z_85 Int) (v_y_85 Int) (v_y_143 Int)) (let ((.cse72 (+ .cse7 v_z_143)) (.cse71 (+ (* v_z_143 65535) (* 65536 v_y_143))) (.cse73 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< 65535 .cse71) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) (+ .cse2 (* .cse70 65536) 65537)) (< v_z_85 0) (< 65535 .cse72) (= .cse2 .cse72) (< v_z_143 0) (< .cse71 .cse73) (< .cse73 0) (< (+ v_z_85 .cse10) .cse50) (< 65535 v_z_85)))))) (or .cse64 .cse22 .cse8) (or (forall ((v_z_143 Int) (v_z_85 Int) (v_y_85 Int) (v_y_143 Int)) (let ((.cse75 (+ .cse7 v_z_143)) (.cse74 (+ (* v_z_143 65535) (* 65536 v_y_143))) (.cse76 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< 65535 .cse74) (< v_z_85 0) (< 65535 .cse75) (= .cse2 .cse75) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse12) (< v_z_143 0) (< .cse74 .cse76) (< .cse76 0) (< 65535 v_z_85)))) .cse21 .cse23) (or (forall ((v_z_143 Int) (v_z_85 Int) (v_y_85 Int) (v_y_143 Int)) (let ((.cse77 (+ (* v_z_143 65535) (* 65536 v_y_143))) (.cse79 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse78 (+ .cse7 v_z_143))) (or (< .cse2 (+ v_z_85 1)) (< 65535 .cse77) (< v_z_85 0) (= .cse5 .cse78) (< 65535 v_z_143) (< .cse77 .cse79) (< .cse79 0) (< .cse78 65536)))) .cse8) (or (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse80 (+ v_z_82 .cse7)) (.cse81 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse5 .cse80) (< 65535 .cse81) (< .cse80 65536) (< 65535 v_z_82) (< .cse81 0)))) .cse8) (or (forall ((v_y_140 Int) (v_z_85 Int) (v_y_85 Int) (v_z_140 Int)) (let ((.cse82 (+ .cse7 v_z_140)) (.cse83 (+ (* 65536 v_y_140) (* v_z_140 65535))) (.cse84 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (= .cse82 .cse5) (< .cse82 65536) (< v_z_85 0) (< 65535 .cse83) (< .cse83 .cse84) (< 65535 v_z_140) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse20) (< .cse84 0) (< 65535 v_z_85)))) .cse8) (or (forall ((v_y_140 Int) (v_z_85 Int) (v_y_85 Int) (v_z_140 Int)) (let ((.cse86 (+ (* 65536 v_y_140) (* v_z_140 65535))) (.cse87 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse85 (+ .cse7 v_z_140))) (or (< .cse2 (+ v_z_85 1)) (= .cse2 .cse85) (< v_z_85 0) (< 65535 .cse86) (< .cse86 .cse87) (< v_z_140 0) (< .cse87 0) (< 65535 .cse85)))) .cse8) (or (forall ((v_y_140 Int) (v_z_85 Int) (v_y_85 Int) (v_z_140 Int)) (let ((.cse89 (+ (* 65536 v_y_140) (* v_z_140 65535))) (.cse90 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse88 (+ .cse7 v_z_140))) (or (= .cse2 .cse88) (< v_z_85 0) (< 65535 .cse89) (< .cse89 .cse90) (< v_z_140 0) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) .cse20) (< .cse90 0) (< 65535 .cse88) (< 65535 v_z_85)))) .cse8) (or .cse26 (forall ((v_z_146 Int) (v_z_85 Int) (v_y_146 Int) (v_y_85 Int)) (let ((.cse91 (+ (* v_z_146 65535) (* 65536 v_y_146))) (.cse92 (+ .cse7 v_z_146)) (.cse93 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< 65535 .cse91) (< (+ v_z_85 .cse10) 65537) (< 65535 v_z_146) (= .cse2 .cse92) (< .cse91 .cse93) (= .cse5 .cse92) (< v_z_146 0) (< .cse93 0) (< 65535 v_z_85) (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) 131072))))) (or .cse22 .cse8) (or (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse94 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse95 (+ v_z_82 .cse7))) (or (< 65535 .cse94) (= .cse2 .cse95) (< .cse94 0) (< 65535 .cse95) (< v_z_82 0)))) .cse8) (or (< .cse10 8644) .cse8) (forall ((v_z_146 Int)) (let ((.cse98 (+ .cse7 v_z_146))) (or (forall ((v_y_146 Int)) (let ((.cse96 (+ (* v_z_146 65535) (* 65536 v_y_146)))) (or (< 65535 .cse96) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse97 (+ (* 65536 v_y_85) (* v_z_85 65535)))) (or (< (+ v_z_85 c_~var_1_13~0 .cse10 .cse1 .cse11) (+ 131073 .cse2)) (< (+ v_z_85 .cse10) .cse15) (< .cse96 .cse97) (< .cse97 0) (< 65535 v_z_85))))))) (< 65535 .cse98) (= .cse2 .cse98) (< v_z_146 0)))) (or (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse99 (+ v_z_82 .cse7)) (.cse100 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse5 .cse99) (< 65535 .cse100) (< 65535 v_z_82) (= .cse2 .cse99) (< .cse100 0) (< v_z_82 0)))) .cse8))))))))) is different from false [2023-11-29 01:47:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-11-29 01:47:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463642383] [2023-11-29 01:47:10,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:47:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558713202] [2023-11-29 01:47:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558713202] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:10,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:10,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2023-11-29 01:47:10,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672041600] [2023-11-29 01:47:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:10,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:47:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:10,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:47:10,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=574, Unknown=7, NotChecked=52, Total=812 [2023-11-29 01:47:10,928 INFO L87 Difference]: Start difference. First operand 235 states and 383 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-29 01:47:38,167 WARN L293 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 257 DAG size of output: 18 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:48:10,013 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (mod c_~var_1_5~0 65536)) (.cse39 (mod c_~var_1_1~0 65536)) (.cse107 (* 65535 c_~var_1_5~0)) (.cse108 (* 65535 c_~var_1_7~0)) (.cse12 (mod c_~var_1_4~0 65536))) (let ((.cse21 (< 56892 .cse12)) (.cse28 (= .cse39 (mod (+ .cse107 c_~var_1_4~0 .cse108) 65536))) (.cse32 (mod (+ .cse107 c_~var_1_4~0) 65536)) (.cse0 (mod c_~var_1_14~0 65536)) (.cse106 (+ .cse11 c_~var_1_11~0)) (.cse105 (mod c_~var_1_16~0 65536)) (.cse49 (mod c_~var_1_7~0 65536)) (.cse58 (+ .cse11 1)) (.cse10 (= (mod c_~last_1_var_1_8~0 256) 0))) (let ((.cse3 (not .cse10)) (.cse8 (< .cse49 .cse58)) (.cse9 (< 65534 .cse49)) (.cse4 (< .cse11 .cse49)) (.cse5 (< 65534 .cse11)) (.cse7 (= .cse39 .cse11)) (.cse81 (or (= .cse32 .cse0) (< .cse106 (+ .cse105 1)))) (.cse56 (= 1 (mod c_~var_1_8~0 256))) (.cse65 (or .cse21 .cse28)) (.cse13 (= .cse39 (mod (+ .cse107 .cse108 56892) 65536))) (.cse34 (+ .cse39 65536)) (.cse30 (+ .cse49 1)) (.cse37 (mod (+ .cse107 56892) 65536)) (.cse20 (< .cse12 56893)) (.cse82 (or (< .cse105 .cse106) (= .cse0 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536))))) (let ((.cse6 (< c_~var_1_13~0 0)) (.cse1 (let ((.cse83 (mod c_~var_1_11~0 4294967296))) (and (or .cse3 (and (or .cse8 .cse9 .cse7 (< .cse83 .cse30)) (or .cse4 (< .cse83 .cse58) .cse5 .cse7))) .cse81 .cse56 (or .cse10 (and .cse65 (or .cse21 (and (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse84 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< v_z_84 0) (< 65535 .cse84) (< .cse83 .cse84) (< .cse84 .cse30) (< 65535 v_z_84)))) (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse85 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 .cse85) (< (+ v_z_84 .cse32) 65536) (< .cse83 .cse85) (< .cse85 .cse30) (< 65535 v_z_84)))) (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse86 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 (+ v_z_84 .cse32)) (< v_z_84 0) (< 65535 .cse86) (< .cse83 .cse86) (< .cse86 .cse30)))))) (or .cse13 .cse20 (and (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse87 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse88 (+ v_z_85 .cse32))) (or (< v_z_85 0) (< .cse83 .cse87) (< 65535 .cse88) (< .cse49 .cse87) (< .cse87 0) (= .cse39 .cse88)))) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse89 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse90 (+ v_z_85 .cse32))) (or (< .cse83 .cse89) (< .cse49 .cse89) (< .cse90 65536) (< .cse89 0) (= .cse90 .cse34) (< 65535 v_z_85)))) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse91 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse92 (+ v_z_85 .cse32))) (or (< v_z_85 0) (< .cse83 .cse91) (< .cse49 .cse91) (< .cse91 0) (= .cse92 .cse34) (= .cse39 .cse92) (< 65535 v_z_85)))))) (or (and (or .cse13 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse93 (+ v_z_82 .cse37)) (.cse94 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse34 .cse93) (< 65535 .cse94) (< .cse93 65536) (< 65535 v_z_82) (< .cse83 .cse94) (< .cse94 0))))) (forall ((v_z_82 Int)) (let ((.cse95 (+ v_z_82 .cse37))) (or (= .cse34 .cse95) (< .cse95 65536) (< 65535 v_z_82) (forall ((v_y_82 Int)) (let ((.cse96 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse96) (< .cse83 .cse96) (< .cse96 .cse30))))))) (or .cse13 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse97 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse98 (+ v_z_82 .cse37))) (or (< 65535 .cse97) (= .cse39 .cse98) (< .cse83 .cse97) (< .cse97 0) (< 65535 .cse98) (< v_z_82 0))))) (forall ((v_z_82 Int)) (let ((.cse99 (+ v_z_82 .cse37))) (or (= .cse39 .cse99) (< 65535 .cse99) (forall ((v_y_82 Int)) (let ((.cse100 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse100) (< .cse83 .cse100) (< .cse100 .cse30)))) (< v_z_82 0)))) (or (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse101 (+ v_z_82 .cse37)) (.cse102 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse34 .cse101) (< 65535 .cse102) (< 65535 v_z_82) (= .cse39 .cse101) (< .cse83 .cse102) (< .cse102 0) (< v_z_82 0)))) .cse13) (forall ((v_z_82 Int)) (let ((.cse103 (+ v_z_82 .cse37))) (or (= .cse34 .cse103) (< 65535 v_z_82) (= .cse39 .cse103) (forall ((v_y_82 Int)) (let ((.cse104 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse104) (< .cse83 .cse104) (< .cse104 .cse30)))) (< v_z_82 0))))) .cse20))) .cse82))) (.cse2 (= (mod c_~var_1_9~0 256) 0))) (and (or (< |c_ULTIMATE.start_step_~stepLocal_4~0#1| .cse0) .cse1 .cse2) (or (and (or .cse3 (and (or .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse6 .cse7))) (or .cse10 (let ((.cse27 (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse54 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse55 (+ v_z_85 .cse32))) (or (< .cse49 .cse54) (< .cse55 65536) (< .cse54 0) (= .cse55 .cse34) (< 65535 v_z_85))))) (.cse25 (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse53 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse52 (+ v_z_85 .cse32))) (or (< v_z_85 0) (< 65535 .cse52) (< .cse49 .cse53) (< .cse53 0) (= .cse39 .cse52))))) (.cse26 (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse50 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse51 (+ v_z_85 .cse32))) (or (< v_z_85 0) (< .cse49 .cse50) (< .cse50 0) (= .cse51 .cse34) (= .cse39 .cse51) (< 65535 v_z_85))))) (.cse17 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse47 (+ v_z_82 .cse37)) (.cse48 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse34 .cse47) (< 65535 .cse48) (< 65535 v_z_82) (= .cse39 .cse47) (< .cse48 0) (< v_z_82 0))))) (.cse19 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse45 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse46 (+ v_z_82 .cse37))) (or (< 65535 .cse45) (= .cse39 .cse46) (< .cse45 .cse30) (< 65535 .cse46) (< v_z_82 0))))) (.cse16 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse43 (+ v_z_82 .cse37)) (.cse44 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse34 .cse43) (< 65535 .cse44) (< 65535 v_z_82) (= .cse39 .cse43) (< .cse44 .cse30) (< v_z_82 0))))) (.cse15 (forall ((v_y_82 Int) (v_z_82 Int)) (let ((.cse41 (+ v_z_82 .cse37)) (.cse42 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse34 .cse41) (< 65535 .cse42) (< .cse41 65536) (< 65535 v_z_82) (< .cse42 .cse30))))) (.cse18 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse38 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse40 (+ v_z_82 .cse37))) (or (< 65535 .cse38) (= .cse39 .cse40) (< .cse38 0) (< 65535 .cse40) (< v_z_82 0))))) (.cse14 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse35 (+ v_z_82 .cse37)) (.cse36 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse34 .cse35) (< 65535 .cse36) (< .cse35 65536) (< 65535 v_z_82) (< .cse36 0))))) (.cse22 (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse33 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 (+ v_z_84 .cse32)) (< v_z_84 0) (< 65535 .cse33) (< .cse33 .cse30))))) (.cse23 (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse31 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 .cse31) (< (+ v_z_84 .cse32) 65536) (< .cse31 .cse30) (< 65535 v_z_84))))) (.cse24 (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse29 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< v_z_84 0) (< 65535 .cse29) (< .cse29 .cse30) (< 65535 v_z_84)))))) (and (or (< (+ (* 65536 (div (+ (* (- 1) .cse11) .cse12) 65536)) c_~var_1_13~0 .cse11) .cse12) (and (or (and (or .cse13 .cse14) .cse15 .cse16 (or .cse13 .cse17) (or .cse18 .cse13) .cse19) .cse20) (or .cse21 (and .cse22 .cse23 .cse24)) (or .cse13 (and .cse25 .cse26 .cse27) .cse20))) (or .cse13 .cse20 (and (or .cse6 .cse27) (or .cse25 .cse6) (or .cse26 .cse6))) (or .cse21 .cse28 .cse6) (or (and (or .cse13 .cse17 .cse6) (or .cse19 .cse6) (or .cse16 .cse6) (or .cse15 .cse6) (or .cse18 .cse13 .cse6) (or .cse13 .cse14 .cse6)) .cse20) (or .cse21 (and (or .cse22 .cse6) (or .cse23 .cse6) (or .cse6 .cse24)))))) (or .cse56 .cse6)) .cse2) (or (< c_~var_1_13~0 .cse0) .cse1 .cse2) (or .cse10 .cse6) (or (let ((.cse57 (mod c_~var_1_17~0 4294967296))) (and (or .cse3 (and (or .cse4 .cse5 (< .cse57 .cse58) .cse7) (or .cse8 (< .cse57 .cse30) .cse9 .cse7))) (or .cse10 (and (or .cse13 (and (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse59 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse60 (+ v_z_85 .cse32))) (or (< v_z_85 0) (< .cse57 .cse59) (< 65535 .cse60) (< .cse49 .cse59) (< .cse59 0) (= .cse39 .cse60)))) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse61 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse62 (+ v_z_85 .cse32))) (or (< .cse57 .cse61) (< .cse49 .cse61) (< .cse62 65536) (< .cse61 0) (= .cse62 .cse34) (< 65535 v_z_85)))) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse63 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse64 (+ v_z_85 .cse32))) (or (< v_z_85 0) (< .cse57 .cse63) (< .cse49 .cse63) (< .cse63 0) (= .cse64 .cse34) (= .cse39 .cse64) (< 65535 v_z_85))))) .cse20) .cse65 (or .cse21 (and (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse66 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 .cse66) (< (+ v_z_84 .cse32) 65536) (< .cse57 .cse66) (< .cse66 .cse30) (< 65535 v_z_84)))) (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse67 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 (+ v_z_84 .cse32)) (< v_z_84 0) (< 65535 .cse67) (< .cse57 .cse67) (< .cse67 .cse30)))) (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse68 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< v_z_84 0) (< 65535 .cse68) (< .cse57 .cse68) (< .cse68 .cse30) (< 65535 v_z_84)))))) (or (and (or .cse13 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse69 (+ v_z_82 .cse37)) (.cse70 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse34 .cse69) (< 65535 .cse70) (< .cse69 65536) (< 65535 v_z_82) (< .cse57 .cse70) (< .cse70 0))))) (forall ((v_z_82 Int)) (let ((.cse71 (+ v_z_82 .cse37))) (or (= .cse34 .cse71) (< .cse71 65536) (< 65535 v_z_82) (forall ((v_y_82 Int)) (let ((.cse72 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse72) (< .cse57 .cse72) (< .cse72 .cse30))))))) (or .cse13 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse73 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse74 (+ v_z_82 .cse37))) (or (< 65535 .cse73) (< .cse57 .cse73) (= .cse39 .cse74) (< .cse73 0) (< 65535 .cse74) (< v_z_82 0))))) (or .cse13 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse75 (+ v_z_82 .cse37)) (.cse76 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse34 .cse75) (< 65535 .cse76) (< 65535 v_z_82) (< .cse57 .cse76) (= .cse39 .cse75) (< .cse76 0) (< v_z_82 0))))) (forall ((v_z_82 Int)) (let ((.cse77 (+ v_z_82 .cse37))) (or (= .cse34 .cse77) (< 65535 v_z_82) (= .cse39 .cse77) (forall ((v_y_82 Int)) (let ((.cse78 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse78) (< .cse57 .cse78) (< .cse78 .cse30)))) (< v_z_82 0)))) (forall ((v_z_82 Int)) (let ((.cse79 (+ v_z_82 .cse37))) (or (= .cse39 .cse79) (forall ((v_y_82 Int)) (let ((.cse80 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse80) (< .cse57 .cse80) (< .cse80 .cse30)))) (< 65535 .cse79) (< v_z_82 0))))) .cse20))) .cse81 .cse56 .cse82)) .cse2) (or .cse1 (< |c_ULTIMATE.start_step_#t~ite11#1| .cse0) .cse2)))))) is different from false [2023-11-29 01:48:16,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:48:20,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:48:24,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:48:25,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:48:26,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:48:28,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:48:32,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:48:35,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:49:03,080 WARN L293 SmtUtils]: Spent 11.35s on a formula simplification. DAG size of input: 286 DAG size of output: 284 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:49:04,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:49:05,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:49:10,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:49:12,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:49:32,206 WARN L293 SmtUtils]: Spent 14.46s on a formula simplification. DAG size of input: 287 DAG size of output: 269 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:49:34,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:49:36,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:49:40,558 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 01:49:43,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:49:55,402 WARN L293 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 219 DAG size of output: 206 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:49:59,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:50:00,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:50:02,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:50:05,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:50:08,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:50:12,292 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse36 (mod c_~var_1_1~0 65536)) (.cse107 (* 65535 c_~var_1_7~0)) (.cse9 (mod c_~var_1_4~0 65536)) (.cse8 (mod c_~var_1_5~0 65536)) (.cse106 (* 65535 c_~var_1_5~0))) (let ((.cse29 (mod (+ .cse106 c_~var_1_4~0) 65536)) (.cse55 (mod c_~var_1_14~0 65536)) (.cse105 (+ .cse8 c_~var_1_11~0)) (.cse104 (mod c_~var_1_16~0 65536)) (.cse18 (< 56892 .cse9)) (.cse25 (= .cse36 (mod (+ .cse106 c_~var_1_4~0 .cse107) 65536))) (.cse57 (+ .cse8 1)) (.cse46 (mod c_~var_1_7~0 65536)) (.cse7 (= (mod c_~last_1_var_1_8~0 256) 0))) (let ((.cse0 (not .cse7)) (.cse1 (< .cse8 .cse46)) (.cse2 (< 65534 .cse8)) (.cse5 (< .cse46 .cse57)) (.cse6 (< 65534 .cse46)) (.cse4 (= .cse36 .cse8)) (.cse59 (or .cse18 .cse25)) (.cse10 (= .cse36 (mod (+ .cse106 .cse107 56892) 65536))) (.cse31 (+ .cse36 65536)) (.cse27 (+ .cse46 1)) (.cse34 (mod (+ .cse106 56892) 65536)) (.cse17 (< .cse9 56893)) (.cse58 (or (= .cse29 .cse55) (< .cse105 (+ .cse104 1)))) (.cse53 (= 1 (mod c_~var_1_8~0 256))) (.cse81 (or (< .cse104 .cse105) (= .cse55 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536)))) (.cse54 (= (mod c_~var_1_9~0 256) 0))) (and (or (let ((.cse3 (< c_~var_1_13~0 0))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse3 .cse4))) (or .cse7 (let ((.cse24 (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse51 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse52 (+ v_z_85 .cse29))) (or (< .cse46 .cse51) (< .cse52 65536) (< .cse51 0) (= .cse52 .cse31) (< 65535 v_z_85))))) (.cse22 (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse50 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse49 (+ v_z_85 .cse29))) (or (< v_z_85 0) (< 65535 .cse49) (< .cse46 .cse50) (< .cse50 0) (= .cse36 .cse49))))) (.cse23 (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse47 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse48 (+ v_z_85 .cse29))) (or (< v_z_85 0) (< .cse46 .cse47) (< .cse47 0) (= .cse48 .cse31) (= .cse36 .cse48) (< 65535 v_z_85))))) (.cse14 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse44 (+ v_z_82 .cse34)) (.cse45 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse31 .cse44) (< 65535 .cse45) (< 65535 v_z_82) (= .cse36 .cse44) (< .cse45 0) (< v_z_82 0))))) (.cse16 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse42 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse43 (+ v_z_82 .cse34))) (or (< 65535 .cse42) (= .cse36 .cse43) (< .cse42 .cse27) (< 65535 .cse43) (< v_z_82 0))))) (.cse13 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse40 (+ v_z_82 .cse34)) (.cse41 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse31 .cse40) (< 65535 .cse41) (< 65535 v_z_82) (= .cse36 .cse40) (< .cse41 .cse27) (< v_z_82 0))))) (.cse12 (forall ((v_y_82 Int) (v_z_82 Int)) (let ((.cse38 (+ v_z_82 .cse34)) (.cse39 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse31 .cse38) (< 65535 .cse39) (< .cse38 65536) (< 65535 v_z_82) (< .cse39 .cse27))))) (.cse15 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse35 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse37 (+ v_z_82 .cse34))) (or (< 65535 .cse35) (= .cse36 .cse37) (< .cse35 0) (< 65535 .cse37) (< v_z_82 0))))) (.cse11 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse32 (+ v_z_82 .cse34)) (.cse33 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse31 .cse32) (< 65535 .cse33) (< .cse32 65536) (< 65535 v_z_82) (< .cse33 0))))) (.cse19 (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse30 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 (+ v_z_84 .cse29)) (< v_z_84 0) (< 65535 .cse30) (< .cse30 .cse27))))) (.cse20 (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse28 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 .cse28) (< (+ v_z_84 .cse29) 65536) (< .cse28 .cse27) (< 65535 v_z_84))))) (.cse21 (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse26 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< v_z_84 0) (< 65535 .cse26) (< .cse26 .cse27) (< 65535 v_z_84)))))) (and (or (< (+ (* 65536 (div (+ (* (- 1) .cse8) .cse9) 65536)) c_~var_1_13~0 .cse8) .cse9) (and (or (and (or .cse10 .cse11) .cse12 .cse13 (or .cse10 .cse14) (or .cse15 .cse10) .cse16) .cse17) (or .cse18 (and .cse19 .cse20 .cse21)) (or .cse10 (and .cse22 .cse23 .cse24) .cse17))) (or .cse10 .cse17 (and (or .cse3 .cse24) (or .cse22 .cse3) (or .cse23 .cse3))) (or .cse18 .cse25 .cse3) (or (and (or .cse10 .cse14 .cse3) (or .cse16 .cse3) (or .cse13 .cse3) (or .cse12 .cse3) (or .cse15 .cse10 .cse3) (or .cse10 .cse11 .cse3)) .cse17) (or .cse18 (and (or .cse19 .cse3) (or .cse20 .cse3) (or .cse3 .cse21)))))) (or .cse53 .cse3))) .cse54) (or (< c_~var_1_13~0 .cse55) (let ((.cse56 (mod c_~var_1_11~0 4294967296))) (and (or .cse0 (and (or .cse5 .cse6 .cse4 (< .cse56 .cse27)) (or .cse1 (< .cse56 .cse57) .cse2 .cse4))) .cse58 .cse53 (or .cse7 (and .cse59 (or .cse18 (and (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse60 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< v_z_84 0) (< 65535 .cse60) (< .cse56 .cse60) (< .cse60 .cse27) (< 65535 v_z_84)))) (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse61 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 .cse61) (< (+ v_z_84 .cse29) 65536) (< .cse56 .cse61) (< .cse61 .cse27) (< 65535 v_z_84)))) (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse62 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 (+ v_z_84 .cse29)) (< v_z_84 0) (< 65535 .cse62) (< .cse56 .cse62) (< .cse62 .cse27)))))) (or .cse10 .cse17 (and (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse63 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse64 (+ v_z_85 .cse29))) (or (< v_z_85 0) (< .cse56 .cse63) (< 65535 .cse64) (< .cse46 .cse63) (< .cse63 0) (= .cse36 .cse64)))) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse65 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse66 (+ v_z_85 .cse29))) (or (< .cse56 .cse65) (< .cse46 .cse65) (< .cse66 65536) (< .cse65 0) (= .cse66 .cse31) (< 65535 v_z_85)))) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse67 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse68 (+ v_z_85 .cse29))) (or (< v_z_85 0) (< .cse56 .cse67) (< .cse46 .cse67) (< .cse67 0) (= .cse68 .cse31) (= .cse36 .cse68) (< 65535 v_z_85)))))) (or (and (or .cse10 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse69 (+ v_z_82 .cse34)) (.cse70 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse31 .cse69) (< 65535 .cse70) (< .cse69 65536) (< 65535 v_z_82) (< .cse56 .cse70) (< .cse70 0))))) (forall ((v_z_82 Int)) (let ((.cse71 (+ v_z_82 .cse34))) (or (= .cse31 .cse71) (< .cse71 65536) (< 65535 v_z_82) (forall ((v_y_82 Int)) (let ((.cse72 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse72) (< .cse56 .cse72) (< .cse72 .cse27))))))) (or .cse10 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse73 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse74 (+ v_z_82 .cse34))) (or (< 65535 .cse73) (= .cse36 .cse74) (< .cse56 .cse73) (< .cse73 0) (< 65535 .cse74) (< v_z_82 0))))) (forall ((v_z_82 Int)) (let ((.cse75 (+ v_z_82 .cse34))) (or (= .cse36 .cse75) (< 65535 .cse75) (forall ((v_y_82 Int)) (let ((.cse76 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse76) (< .cse56 .cse76) (< .cse76 .cse27)))) (< v_z_82 0)))) (or (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse77 (+ v_z_82 .cse34)) (.cse78 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse31 .cse77) (< 65535 .cse78) (< 65535 v_z_82) (= .cse36 .cse77) (< .cse56 .cse78) (< .cse78 0) (< v_z_82 0)))) .cse10) (forall ((v_z_82 Int)) (let ((.cse79 (+ v_z_82 .cse34))) (or (= .cse31 .cse79) (< 65535 v_z_82) (= .cse36 .cse79) (forall ((v_y_82 Int)) (let ((.cse80 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse80) (< .cse56 .cse80) (< .cse80 .cse27)))) (< v_z_82 0))))) .cse17))) .cse81)) .cse54) (or (let ((.cse82 (mod c_~var_1_17~0 4294967296))) (and (or .cse0 (and (or .cse1 .cse2 (< .cse82 .cse57) .cse4) (or .cse5 (< .cse82 .cse27) .cse6 .cse4))) (or .cse7 (and (or .cse10 (and (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse83 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse84 (+ v_z_85 .cse29))) (or (< v_z_85 0) (< .cse82 .cse83) (< 65535 .cse84) (< .cse46 .cse83) (< .cse83 0) (= .cse36 .cse84)))) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse85 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse86 (+ v_z_85 .cse29))) (or (< .cse82 .cse85) (< .cse46 .cse85) (< .cse86 65536) (< .cse85 0) (= .cse86 .cse31) (< 65535 v_z_85)))) (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse87 (+ (* 65536 v_y_85) (* v_z_85 65535))) (.cse88 (+ v_z_85 .cse29))) (or (< v_z_85 0) (< .cse82 .cse87) (< .cse46 .cse87) (< .cse87 0) (= .cse88 .cse31) (= .cse36 .cse88) (< 65535 v_z_85))))) .cse17) .cse59 (or .cse18 (and (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse89 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 .cse89) (< (+ v_z_84 .cse29) 65536) (< .cse82 .cse89) (< .cse89 .cse27) (< 65535 v_z_84)))) (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse90 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< 65535 (+ v_z_84 .cse29)) (< v_z_84 0) (< 65535 .cse90) (< .cse82 .cse90) (< .cse90 .cse27)))) (forall ((v_z_84 Int) (v_y_84 Int)) (let ((.cse91 (+ (* v_z_84 65535) (* 65536 v_y_84)))) (or (< v_z_84 0) (< 65535 .cse91) (< .cse82 .cse91) (< .cse91 .cse27) (< 65535 v_z_84)))))) (or (and (or .cse10 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse92 (+ v_z_82 .cse34)) (.cse93 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse31 .cse92) (< 65535 .cse93) (< .cse92 65536) (< 65535 v_z_82) (< .cse82 .cse93) (< .cse93 0))))) (forall ((v_z_82 Int)) (let ((.cse94 (+ v_z_82 .cse34))) (or (= .cse31 .cse94) (< .cse94 65536) (< 65535 v_z_82) (forall ((v_y_82 Int)) (let ((.cse95 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse95) (< .cse82 .cse95) (< .cse95 .cse27))))))) (or .cse10 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse96 (+ (* 65536 v_y_82) (* v_z_82 65535))) (.cse97 (+ v_z_82 .cse34))) (or (< 65535 .cse96) (< .cse82 .cse96) (= .cse36 .cse97) (< .cse96 0) (< 65535 .cse97) (< v_z_82 0))))) (or .cse10 (forall ((v_z_82 Int) (v_y_82 Int)) (let ((.cse98 (+ v_z_82 .cse34)) (.cse99 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (= .cse31 .cse98) (< 65535 .cse99) (< 65535 v_z_82) (< .cse82 .cse99) (= .cse36 .cse98) (< .cse99 0) (< v_z_82 0))))) (forall ((v_z_82 Int)) (let ((.cse100 (+ v_z_82 .cse34))) (or (= .cse31 .cse100) (< 65535 v_z_82) (= .cse36 .cse100) (forall ((v_y_82 Int)) (let ((.cse101 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse101) (< .cse82 .cse101) (< .cse101 .cse27)))) (< v_z_82 0)))) (forall ((v_z_82 Int)) (let ((.cse102 (+ v_z_82 .cse34))) (or (= .cse36 .cse102) (forall ((v_y_82 Int)) (let ((.cse103 (+ (* 65536 v_y_82) (* v_z_82 65535)))) (or (< 65535 .cse103) (< .cse82 .cse103) (< .cse103 .cse27)))) (< 65535 .cse102) (< v_z_82 0))))) .cse17))) .cse58 .cse53 .cse81)) .cse54))))) is different from false [2023-11-29 01:50:16,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:50:21,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:50:26,011 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 01:50:30,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:50:34,124 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 01:50:58,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:02,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:06,853 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 01:51:10,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:15,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:18,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:22,649 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 01:51:31,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:35,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:37,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:42,623 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 01:51:46,648 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 01:51:50,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:55,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:51:58,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:02,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:10,487 WARN L293 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 218 DAG size of output: 205 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:52:12,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:16,595 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 01:52:20,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:22,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:27,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:31,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:35,196 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 01:52:37,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:40,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:45,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:52:47,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:53:21,605 WARN L293 SmtUtils]: Spent 14.77s on a formula simplification. DAG size of input: 291 DAG size of output: 289 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:53:26,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:53:29,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:53:31,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:53:35,394 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 01:53:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:35,541 INFO L93 Difference]: Finished difference Result 515 states and 818 transitions. [2023-11-29 01:53:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 01:53:35,542 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2023-11-29 01:53:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:35,549 INFO L225 Difference]: With dead ends: 515 [2023-11-29 01:53:35,549 INFO L226 Difference]: Without dead ends: 384 [2023-11-29 01:53:35,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 248.4s TimeCoverageRelationStatistics Valid=366, Invalid=1608, Unknown=18, NotChecked=264, Total=2256 [2023-11-29 01:53:35,552 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 400 mSDsluCounter, 2007 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 28 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 188.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 190.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:35,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 2206 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 884 Invalid, 28 Unknown, 308 Unchecked, 190.4s Time] [2023-11-29 01:53:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-11-29 01:53:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 248. [2023-11-29 01:53:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 149 states have internal predecessors, (211), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 01:53:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 403 transitions. [2023-11-29 01:53:35,600 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 403 transitions. Word has length 293 [2023-11-29 01:53:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:35,601 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 403 transitions. [2023-11-29 01:53:35,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-29 01:53:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 403 transitions. [2023-11-29 01:53:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-11-29 01:53:35,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:35,606 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:35,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:53:35,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:53:35,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:35,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1438435447, now seen corresponding path program 1 times [2023-11-29 01:53:35,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:53:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360769083] [2023-11-29 01:53:35,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:53:35,859 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:53:35,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1632706169] [2023-11-29 01:53:35,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:35,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:53:35,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:53:35,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:53:35,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:53:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:36,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:53:36,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1311 proven. 117 refuted. 0 times theorem prover too weak. 3084 trivial. 0 not checked. [2023-11-29 01:53:36,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:53:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2023-11-29 01:53:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:53:37,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360769083] [2023-11-29 01:53:37,064 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:53:37,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632706169] [2023-11-29 01:53:37,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632706169] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:53:37,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:53:37,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-11-29 01:53:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5319003] [2023-11-29 01:53:37,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:53:37,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:53:37,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:53:37,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:53:37,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:53:37,068 INFO L87 Difference]: Start difference. First operand 248 states and 403 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2023-11-29 01:53:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:37,522 INFO L93 Difference]: Finished difference Result 404 states and 646 transitions. [2023-11-29 01:53:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:53:37,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 293 [2023-11-29 01:53:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:37,527 INFO L225 Difference]: With dead ends: 404 [2023-11-29 01:53:37,528 INFO L226 Difference]: Without dead ends: 260 [2023-11-29 01:53:37,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 578 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:53:37,530 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 86 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:37,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 372 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:53:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-29 01:53:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 256. [2023-11-29 01:53:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 01:53:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 407 transitions. [2023-11-29 01:53:37,572 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 407 transitions. Word has length 293 [2023-11-29 01:53:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:37,573 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 407 transitions. [2023-11-29 01:53:37,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2023-11-29 01:53:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 407 transitions. [2023-11-29 01:53:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-11-29 01:53:37,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:37,577 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:37,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:53:37,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:53:37,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:37,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:37,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1530032199, now seen corresponding path program 1 times [2023-11-29 01:53:37,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:53:37,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594493054] [2023-11-29 01:53:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:37,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:53:37,826 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:53:37,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006347442] [2023-11-29 01:53:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:37,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:53:37,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:53:37,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:53:37,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:53:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:38,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 01:53:38,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2131 proven. 303 refuted. 0 times theorem prover too weak. 2078 trivial. 0 not checked. [2023-11-29 01:53:40,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:53:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 102 proven. 312 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2023-11-29 01:53:41,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:53:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594493054] [2023-11-29 01:53:41,872 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:53:41,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006347442] [2023-11-29 01:53:41,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006347442] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:53:41,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:53:41,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-11-29 01:53:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882593285] [2023-11-29 01:53:41,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:53:41,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 01:53:41,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:53:41,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 01:53:41,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2023-11-29 01:53:41,878 INFO L87 Difference]: Start difference. First operand 256 states and 407 transitions. Second operand has 32 states, 31 states have (on average 3.903225806451613) internal successors, (121), 30 states have internal predecessors, (121), 7 states have call successors, (85), 4 states have call predecessors, (85), 9 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) [2023-11-29 01:53:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:47,612 INFO L93 Difference]: Finished difference Result 555 states and 817 transitions. [2023-11-29 01:53:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-11-29 01:53:47,613 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.903225806451613) internal successors, (121), 30 states have internal predecessors, (121), 7 states have call successors, (85), 4 states have call predecessors, (85), 9 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) Word has length 293 [2023-11-29 01:53:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:47,618 INFO L225 Difference]: With dead ends: 555 [2023-11-29 01:53:47,618 INFO L226 Difference]: Without dead ends: 407 [2023-11-29 01:53:47,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1343, Invalid=4059, Unknown=0, NotChecked=0, Total=5402 [2023-11-29 01:53:47,623 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 623 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:47,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1407 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 01:53:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-29 01:53:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 346. [2023-11-29 01:53:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 228 states have (on average 1.337719298245614) internal successors, (305), 230 states have internal predecessors, (305), 102 states have call successors, (102), 15 states have call predecessors, (102), 15 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2023-11-29 01:53:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 509 transitions. [2023-11-29 01:53:47,681 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 509 transitions. Word has length 293 [2023-11-29 01:53:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:47,682 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 509 transitions. [2023-11-29 01:53:47,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.903225806451613) internal successors, (121), 30 states have internal predecessors, (121), 7 states have call successors, (85), 4 states have call predecessors, (85), 9 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) [2023-11-29 01:53:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 509 transitions. [2023-11-29 01:53:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-11-29 01:53:47,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:47,686 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:47,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:53:47,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:53:47,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:47,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:47,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1346120645, now seen corresponding path program 1 times [2023-11-29 01:53:47,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:53:47,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576597957] [2023-11-29 01:53:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:47,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:53:47,950 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:53:47,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753532599] [2023-11-29 01:53:47,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:47,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:53:47,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:53:47,952 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:53:47,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:53:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:48,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 01:53:48,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-11-29 01:53:54,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:53:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:53:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576597957] [2023-11-29 01:53:54,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:53:54,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753532599] [2023-11-29 01:53:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753532599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:54,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:54,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 01:53:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666741281] [2023-11-29 01:53:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:54,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 01:53:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:53:54,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 01:53:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:53:54,495 INFO L87 Difference]: Start difference. First operand 346 states and 509 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-29 01:53:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:59,269 INFO L93 Difference]: Finished difference Result 959 states and 1387 transitions. [2023-11-29 01:53:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-29 01:53:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2023-11-29 01:53:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:59,278 INFO L225 Difference]: With dead ends: 959 [2023-11-29 01:53:59,278 INFO L226 Difference]: Without dead ends: 739 [2023-11-29 01:53:59,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=397, Invalid=1495, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 01:53:59,280 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 578 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:59,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1274 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 01:53:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-11-29 01:53:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 520. [2023-11-29 01:53:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 342 states have (on average 1.3128654970760234) internal successors, (449), 346 states have internal predecessors, (449), 154 states have call successors, (154), 23 states have call predecessors, (154), 23 states have return successors, (154), 150 states have call predecessors, (154), 154 states have call successors, (154) [2023-11-29 01:53:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 757 transitions. [2023-11-29 01:53:59,354 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 757 transitions. Word has length 293 [2023-11-29 01:53:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:59,355 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 757 transitions. [2023-11-29 01:53:59,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-29 01:53:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 757 transitions. [2023-11-29 01:53:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-11-29 01:53:59,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:59,358 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:59,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:53:59,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:53:59,558 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:59,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash -828967621, now seen corresponding path program 1 times [2023-11-29 01:53:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:53:59,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230990257] [2023-11-29 01:53:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:53:59,595 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:53:59,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077037276] [2023-11-29 01:53:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:59,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:53:59,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:53:59,597 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:53:59,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:53:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:59,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 01:53:59,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:54:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-11-29 01:54:09,453 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:54:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:54:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230990257] [2023-11-29 01:54:09,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:54:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077037276] [2023-11-29 01:54:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077037276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:54:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:54:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 01:54:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569128984] [2023-11-29 01:54:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:54:09,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:54:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:54:09,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:54:09,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:54:09,456 INFO L87 Difference]: Start difference. First operand 520 states and 757 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-29 01:54:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:54:14,036 INFO L93 Difference]: Finished difference Result 1079 states and 1559 transitions. [2023-11-29 01:54:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 01:54:14,037 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2023-11-29 01:54:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:54:14,043 INFO L225 Difference]: With dead ends: 1079 [2023-11-29 01:54:14,043 INFO L226 Difference]: Without dead ends: 662 [2023-11-29 01:54:14,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=307, Invalid=1175, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 01:54:14,046 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 428 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:54:14,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1563 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 01:54:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-11-29 01:54:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 521. [2023-11-29 01:54:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 343 states have (on average 1.3061224489795917) internal successors, (448), 347 states have internal predecessors, (448), 154 states have call successors, (154), 23 states have call predecessors, (154), 23 states have return successors, (154), 150 states have call predecessors, (154), 154 states have call successors, (154) [2023-11-29 01:54:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 756 transitions. [2023-11-29 01:54:14,124 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 756 transitions. Word has length 293 [2023-11-29 01:54:14,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:54:14,125 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 756 transitions. [2023-11-29 01:54:14,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-29 01:54:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 756 transitions. [2023-11-29 01:54:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-11-29 01:54:14,129 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:54:14,130 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:54:14,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 01:54:14,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:54:14,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:54:14,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:54:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash -335003395, now seen corresponding path program 1 times [2023-11-29 01:54:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:54:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750573720] [2023-11-29 01:54:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:54:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:54:14,374 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:54:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746676095] [2023-11-29 01:54:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:54:14,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:54:14,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:54:14,376 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:54:14,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4440c67-948d-4cb1-8c24-3ad264f29671/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:54:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 01:54:14,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:54:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1814 proven. 756 refuted. 0 times theorem prover too weak. 1942 trivial. 0 not checked. [2023-11-29 01:54:29,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:56:34,980 WARN L293 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 338 DAG size of output: 333 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:57:34,093 WARN L293 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 322 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:58:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-11-29 01:58:25,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750573720] [2023-11-29 01:58:25,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:58:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746676095] [2023-11-29 01:58:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746676095] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 01:58:25,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:58:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [36] total 49 [2023-11-29 01:58:25,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054846630] [2023-11-29 01:58:25,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:25,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:58:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:25,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:58:25,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1838, Unknown=29, NotChecked=0, Total=2352 [2023-11-29 01:58:25,215 INFO L87 Difference]: Start difference. First operand 521 states and 756 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48)