./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.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_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/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_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/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_eaefa682-4def-482d-b411-93cac465f354/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 d5b4a8e209cf444024fa31a61bed3ce1f6da7fc096b1acbd25409a9975d7dc6c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:54:07,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:54:08,067 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:54:08,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:54:08,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:54:08,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:54:08,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:54:08,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:54:08,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:54:08,106 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:54:08,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:54:08,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:54:08,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:54:08,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:54:08,109 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:54:08,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:54:08,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:54:08,110 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:54:08,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:54:08,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:54:08,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:54:08,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:54:08,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:54:08,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:54:08,114 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:54:08,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:54:08,114 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:54:08,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:54:08,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:54:08,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:54:08,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:54:08,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:54:08,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:54:08,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:54:08,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:54:08,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:54:08,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:54:08,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:54:08,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:54:08,119 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:54:08,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:54:08,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:54:08,120 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_eaefa682-4def-482d-b411-93cac465f354/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_eaefa682-4def-482d-b411-93cac465f354/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 -> d5b4a8e209cf444024fa31a61bed3ce1f6da7fc096b1acbd25409a9975d7dc6c [2023-11-29 01:54:08,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:54:08,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:54:08,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:54:08,408 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:54:08,408 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:54:08,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2023-11-29 01:54:11,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:54:11,498 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:54:11,498 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2023-11-29 01:54:11,505 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/data/3f63d7ca3/d5668913ac224e03ad763c62d49294ed/FLAG5bff78ccb [2023-11-29 01:54:11,518 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/data/3f63d7ca3/d5668913ac224e03ad763c62d49294ed [2023-11-29 01:54:11,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:54:11,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:54:11,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:54:11,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:54:11,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:54:11,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a843168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11, skipping insertion in model container [2023-11-29 01:54:11,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,551 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:54:11,665 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_eaefa682-4def-482d-b411-93cac465f354/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2023-11-29 01:54:11,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:54:11,709 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:54:11,721 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_eaefa682-4def-482d-b411-93cac465f354/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2023-11-29 01:54:11,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:54:11,756 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:54:11,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11 WrapperNode [2023-11-29 01:54:11,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:54:11,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:54:11,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:54:11,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:54:11,763 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:54:11" (1/1) ... [2023-11-29 01:54:11,771 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:54:11" (1/1) ... [2023-11-29 01:54:11,797 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2023-11-29 01:54:11,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:54:11,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:54:11,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:54:11,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:54:11,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,822 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:54:11,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:54:11,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:54:11,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:54:11,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:54:11,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (1/1) ... [2023-11-29 01:54:11,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:54:11,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:54:11,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/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:54:11,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/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:54:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:54:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:54:11,899 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:54:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:54:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:54:11,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:54:11,976 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:54:11,977 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:54:12,159 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:54:12,200 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:54:12,200 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:54:12,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:54:12 BoogieIcfgContainer [2023-11-29 01:54:12,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:54:12,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:54:12,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:54:12,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:54:12,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:54:11" (1/3) ... [2023-11-29 01:54:12,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75808c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:54:12, skipping insertion in model container [2023-11-29 01:54:12,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:54:11" (2/3) ... [2023-11-29 01:54:12,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75808c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:54:12, skipping insertion in model container [2023-11-29 01:54:12,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:54:12" (3/3) ... [2023-11-29 01:54:12,210 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-41.i [2023-11-29 01:54:12,228 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:54:12,229 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:54:12,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:54:12,288 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;@33715d0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:54:12,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:54:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 01:54:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 01:54:12,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:54:12,306 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:54:12,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:54:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1582176197, now seen corresponding path program 1 times [2023-11-29 01:54:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:54:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288257041] [2023-11-29 01:54:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:54:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:54:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:54:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:54:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:54:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:54:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:54:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:54:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:54:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:54:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:54:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:54:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:54:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:54:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:54:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:54:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:54:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:54:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 01:54:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:54:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288257041] [2023-11-29 01:54:12,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288257041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:54:12,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:54:12,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:54:12,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454115287] [2023-11-29 01:54:12,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:54:12,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:54:12,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:54:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:54:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:54:12,680 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 01:54:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:54:12,715 INFO L93 Difference]: Finished difference Result 86 states and 150 transitions. [2023-11-29 01:54:12,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:54:12,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2023-11-29 01:54:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:54:12,724 INFO L225 Difference]: With dead ends: 86 [2023-11-29 01:54:12,724 INFO L226 Difference]: Without dead ends: 42 [2023-11-29 01:54:12,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:54:12,730 INFO L413 NwaCegarLoop]: 58 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, 58 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:54:12,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:54:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-29 01:54:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-29 01:54:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 01:54:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2023-11-29 01:54:12,768 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 99 [2023-11-29 01:54:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:54:12,769 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2023-11-29 01:54:12,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 01:54:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2023-11-29 01:54:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 01:54:12,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:54:12,773 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:54:12,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:54:12,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:54:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash 509933509, now seen corresponding path program 1 times [2023-11-29 01:54:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:54:12,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458266928] [2023-11-29 01:54:12,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:54:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:54:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:54:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:54:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:54:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:54:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:54:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:54:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:54:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:54:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:54:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:54:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:54:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:54:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:54:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:54:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:54:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:54:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 01:54:14,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:54:14,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458266928] [2023-11-29 01:54:14,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458266928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:54:14,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:54:14,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:54:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125548458] [2023-11-29 01:54:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:54:14,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:54:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:54:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:54:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:54:14,810 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:54:15,300 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2023-11-29 01:54:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:54:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-29 01:54:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:54:15,303 INFO L225 Difference]: With dead ends: 70 [2023-11-29 01:54:15,303 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 01:54:15,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:54:15,306 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 39 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:54:15,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 199 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:54:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 01:54:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. [2023-11-29 01:54:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 01:54:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2023-11-29 01:54:15,319 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 99 [2023-11-29 01:54:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:54:15,321 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2023-11-29 01:54:15,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2023-11-29 01:54:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 01:54:15,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:54:15,324 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:54:15,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:54:15,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:54:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2010026425, now seen corresponding path program 1 times [2023-11-29 01:54:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:54:15,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117045629] [2023-11-29 01:54:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:54:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:54:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:54:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:54:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:54:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:54:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:54:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:54:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:54:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:54:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:54:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:54:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:54:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:54:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:54:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:54:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:54:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:54:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 01:54:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:54:16,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117045629] [2023-11-29 01:54:16,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117045629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:54:16,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:54:16,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:54:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140963307] [2023-11-29 01:54:16,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:54:16,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:54:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:54:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:54:16,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:54:16,368 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:54:16,616 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2023-11-29 01:54:16,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:54:16,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-29 01:54:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:54:16,621 INFO L225 Difference]: With dead ends: 139 [2023-11-29 01:54:16,621 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 01:54:16,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:54:16,623 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:54:16,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 287 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:54:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 01:54:16,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2023-11-29 01:54:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 01:54:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2023-11-29 01:54:16,646 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 99 [2023-11-29 01:54:16,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:54:16,646 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2023-11-29 01:54:16,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2023-11-29 01:54:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 01:54:16,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:54:16,649 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:54:16,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:54:16,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:54:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1189991879, now seen corresponding path program 1 times [2023-11-29 01:54:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:54:16,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310750295] [2023-11-29 01:54:16,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:54:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:54:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:54:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:54:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:54:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:54:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:54:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:54:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:54:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:54:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:54:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:54:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:54:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:54:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:54:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:54:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:54:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:54:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 01:54:17,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:54:17,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310750295] [2023-11-29 01:54:17,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310750295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:54:17,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:54:17,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:54:17,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120445986] [2023-11-29 01:54:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:54:17,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:54:17,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:54:17,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:54:17,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:54:17,746 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:54:18,186 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2023-11-29 01:54:18,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:54:18,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-29 01:54:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:54:18,189 INFO L225 Difference]: With dead ends: 101 [2023-11-29 01:54:18,190 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 01:54:18,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:54:18,191 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 30 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:54:18,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 231 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:54:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 01:54:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2023-11-29 01:54:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 61 states have internal predecessors, (71), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 01:54:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2023-11-29 01:54:18,212 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 99 [2023-11-29 01:54:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:54:18,213 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2023-11-29 01:54:18,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2023-11-29 01:54:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 01:54:18,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:54:18,215 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:54:18,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:54:18,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:54:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1329968055, now seen corresponding path program 1 times [2023-11-29 01:54:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:54:18,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809485436] [2023-11-29 01:54:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:54:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:54:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:54:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:54:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:54:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:54:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:54:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:54:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:54:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:54:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:54:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:54:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:54:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:54:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:54:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:54:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:54:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:54:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 01:54:19,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:54:19,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809485436] [2023-11-29 01:54:19,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809485436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:54:19,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:54:19,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:54:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139799963] [2023-11-29 01:54:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:54:19,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:54:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:54:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:54:19,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:54:19,065 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:54:19,269 INFO L93 Difference]: Finished difference Result 102 states and 136 transitions. [2023-11-29 01:54:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:54:19,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-29 01:54:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:54:19,271 INFO L225 Difference]: With dead ends: 102 [2023-11-29 01:54:19,271 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 01:54:19,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:54:19,273 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:54:19,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 202 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:54:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 01:54:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2023-11-29 01:54:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 01:54:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2023-11-29 01:54:19,292 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 99 [2023-11-29 01:54:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:54:19,293 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2023-11-29 01:54:19,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2023-11-29 01:54:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 01:54:19,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:54:19,295 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:54:19,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:54:19,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:54:19,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1381377011, now seen corresponding path program 1 times [2023-11-29 01:54:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:54:19,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297110224] [2023-11-29 01:54:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:54:19,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:54:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:54:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:54:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:54:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:54:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:54:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:54:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:54:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:54:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:54:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:54:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:54:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:54:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:54:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:54:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:54:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:54:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:54:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 01:54:19,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:54:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297110224] [2023-11-29 01:54:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297110224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:54:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:54:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:54:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819764758] [2023-11-29 01:54:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:54:19,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:54:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:54:19,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:54:19,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:54:19,414 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:54:19,438 INFO L93 Difference]: Finished difference Result 160 states and 221 transitions. [2023-11-29 01:54:19,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:54:19,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-11-29 01:54:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:54:19,439 INFO L225 Difference]: With dead ends: 160 [2023-11-29 01:54:19,439 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 01:54:19,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:54:19,442 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:54:19,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:54:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 01:54:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 01:54:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:54:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 01:54:19,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2023-11-29 01:54:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:54:19,444 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 01:54:19,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 01:54:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 01:54:19,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 01:54:19,447 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:54:19,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:54:19,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 01:54:19,742 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-11-29 01:54:19,742 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-11-29 01:54:19,743 INFO L895 garLoopResultBuilder]: At program point L97-2(lines 97 103) the Hoare annotation is: (or (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (let ((.cse2 (* (div ~var_1_8~0 256) 256))) (let ((.cse0 (= (+ .cse2 1) ~var_1_8~0)) (.cse1 (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0))) (and (or .cse0 (and .cse1 (= .cse2 ~var_1_8~0))) (or (not .cse0) (not .cse1)))))) [2023-11-29 01:54:19,743 INFO L899 garLoopResultBuilder]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2023-11-29 01:54:19,743 INFO L902 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: true [2023-11-29 01:54:19,743 INFO L902 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: true [2023-11-29 01:54:19,743 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-11-29 01:54:19,744 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 01:54:19,744 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 01:54:19,744 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 01:54:19,744 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-29 01:54:19,744 INFO L902 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: true [2023-11-29 01:54:19,744 INFO L902 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: true [2023-11-29 01:54:19,744 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-11-29 01:54:19,745 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-29 01:54:19,745 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 01:54:19,745 INFO L899 garLoopResultBuilder]: For program point L86(lines 62 87) no Hoare annotation was computed. [2023-11-29 01:54:19,745 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-29 01:54:19,745 INFO L902 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: true [2023-11-29 01:54:19,745 INFO L902 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: true [2023-11-29 01:54:19,745 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-29 01:54:19,746 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-11-29 01:54:19,746 INFO L899 garLoopResultBuilder]: For program point L41-2(lines 36 61) no Hoare annotation was computed. [2023-11-29 01:54:19,746 INFO L902 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: true [2023-11-29 01:54:19,746 INFO L902 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: true [2023-11-29 01:54:19,746 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2023-11-29 01:54:19,746 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 39) no Hoare annotation was computed. [2023-11-29 01:54:19,746 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 01:54:19,747 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-11-29 01:54:19,747 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-11-29 01:54:19,747 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-11-29 01:54:19,747 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-29 01:54:19,747 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 01:54:19,747 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-29 01:54:19,747 INFO L902 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: true [2023-11-29 01:54:19,748 INFO L902 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: true [2023-11-29 01:54:19,748 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-29 01:54:19,748 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-11-29 01:54:19,748 INFO L902 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: true [2023-11-29 01:54:19,748 INFO L902 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: true [2023-11-29 01:54:19,748 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-29 01:54:19,748 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 01:54:19,748 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 01:54:19,749 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 01:54:19,749 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 01:54:19,752 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 01:54:19,754 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:54:19,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:54:19 BoogieIcfgContainer [2023-11-29 01:54:19,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:54:19,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:54:19,767 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:54:19,767 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:54:19,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:54:12" (3/4) ... [2023-11-29 01:54:19,769 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 01:54:19,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 01:54:19,778 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 01:54:19,778 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 01:54:19,779 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 01:54:19,779 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 01:54:19,874 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:54:19,875 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 01:54:19,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:54:19,876 INFO L158 Benchmark]: Toolchain (without parser) took 8354.29ms. Allocated memory was 142.6MB in the beginning and 262.1MB in the end (delta: 119.5MB). Free memory was 105.8MB in the beginning and 200.5MB in the end (delta: -94.7MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2023-11-29 01:54:19,876 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:54:19,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.99ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 01:54:19,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.09ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:54:19,877 INFO L158 Benchmark]: Boogie Preprocessor took 37.80ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:54:19,877 INFO L158 Benchmark]: RCFGBuilder took 364.43ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 73.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:54:19,878 INFO L158 Benchmark]: TraceAbstraction took 7562.09ms. Allocated memory was 142.6MB in the beginning and 262.1MB in the end (delta: 119.5MB). Free memory was 73.5MB in the beginning and 205.7MB in the end (delta: -132.2MB). Peak memory consumption was 116.9MB. Max. memory is 16.1GB. [2023-11-29 01:54:19,878 INFO L158 Benchmark]: Witness Printer took 108.64ms. Allocated memory is still 262.1MB. Free memory was 205.7MB in the beginning and 200.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 01:54:19,880 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.99ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.09ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.80ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 364.43ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 73.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7562.09ms. Allocated memory was 142.6MB in the beginning and 262.1MB in the end (delta: 119.5MB). Free memory was 73.5MB in the beginning and 205.7MB in the end (delta: -132.2MB). Peak memory consumption was 116.9MB. Max. memory is 16.1GB. * Witness Printer took 108.64ms. Allocated memory is still 262.1MB. Free memory was 205.7MB in the beginning and 200.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 1079 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 717 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 362 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 101 PreInvPairs, 130 NumberOfFragments, 70 HoareAnnotationTreeSize, 101 FomulaSimplifications, 770 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 1179 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 2321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((var_1_5 == ((var_1_5 / 256) * 256)) || ((((((var_1_8 / 256) * 256) + 1) == var_1_8) || ((((var_1_9 / 256) * 256) == var_1_9) && (((var_1_8 / 256) * 256) == var_1_8))) && (!(((((var_1_8 / 256) * 256) + 1) == var_1_8)) || !((((var_1_9 / 256) * 256) == var_1_9))))) RESULT: Ultimate proved your program to be correct! [2023-11-29 01:54:19,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaefa682-4def-482d-b411-93cac465f354/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE